Browsing by Subject "graphs"

Sort by: Order: Results:

  • Calculul gradientului funcţiei de penalizare în problema max-cut 
    MORARU, V. (Tehnica-Info, 2001)
    Prezenta lucrare este consacrată problemei determinării tăieturii maxime într-un graf. Pentru rezolvarea problemei relaxate max-cut se utilizează metoda punctului interior. Se prezintă o procedură efectivă de calcul al ...
  • Determinarea ratei maxime de transfer a informației dintre două noduri aleatorii ale reţelei de comunicaţii 
    NISTIRIUC, Ana; ABABII, Victor; CHIHAI, Andrei; ŢURCANU, Dinu; BEJAN, Nicolae; ALEXEI, Anatol; NISTIRIUC, Ion; SHARMA POPOVICI, Natalia; NISTIRIUC, Pavel V. (Tehnica UTM, 2018)
    This paper analyzes how to use the Ford- Fulkerson algorithm to determine the maximum data transmission (DT) flow between two nodes of the communication network over a certain period of time.
  • The Disjoint-Set data structure and its performance 
    ANDRIEȘ, Alexandru; KONJEVIC, Alexandra; AFTENI, Maria (Universitatea Tehnică a Moldovei, 2022)
    Disjoint-set data structure is a data structure that stores a collection of disjoint (nonoverlapping) sets.The Disjoint-Set data structures (also called Union-Find) is a very elegant and efficient way of analyzing connectivity ...
  • Domain Specific Language - Data Structure Visualization (DSV) 
    CHETRAR, Eugeniu; DVORAC, Ana; GHERMAN, Artiom (Universitatea Tehnică a Moldovei, 2021)
    This language was created in order to help people with visualization of the data structure. For example, a teacher wants to draw a binary tree to show it for students. Mostly, will spend a lot of time in photo editors, in ...
  • Patrimoniul arhitectonic național în reflecții artistico-plastice 
    MUNTEANU, Angela (Universitatea Tehnică a Moldovei, 2022)
    Cercetarea reflectă autenticitatea poporului ca formă etnică a unui neam, care se definește prin patrimoniul său cultural, un tezaur național specific stilistic, prin opere de artă vizuală de arhitectură, sculptură, pictură, ...
  • Reprezentarea eficientă a sursei de date în reţeaua de comunicaţii 
    NISTIRIUC, Ana; ABABII, Victor; CHIHAI, Andrei; ŢURCANU, Dinu; BEJAN, Nicolae; ALEXEI, Anatol; NISTIRIUC, Ion; SHARMA POPOVICI, Natalia; NISTIRIUC, Pavel V. (Tehnica UTM, 2018)
    This paper analyzes the approach of using Kruskal's algorithm to determine the minimum tree that contains the graph network communications.
  • Social network analysis 
    LOZOVANU, Mihaela; CIORBA, Dumitru (Tehnica UTM, 2012)
    Nowadays dealing with social network analysis becomes more and more attractive. It is especially true for the field of agent-based modeling, in which represented actors are connected with other, with which they communicate. ...
  • Topological modelling of the metrological impedance simulators 
    NASTAS, Vitalie; NICOLAEV, Pavel (Universitaria, 2009)
    The given research represents an analysis of impedance simulators circuits principle of work by means of the oriented graphs method. The veracity of the obtained results is confirmed by comparing the latter with those ...

Search DSpace

Browse

My Account