• PARALLEL ALGORITHM TO FIND BAYES-NASH SOLUTION 

  Hancu, Boris; Gladei, Anatolie (Institutul de Matematică şi Informatică al Academiei de Ştiinţe a Moldovei, 2018)

  We propose to use the new methodology for solving the com- plete and perfect information bimatrix game. To solve the ga- mes of these type we construct the incomplete and imperfect information game generated by the ...
• ON NONTRIVIAL COVERS AND PARTITIONS OF GRAPHS BY CONVEX SETS 

  Buzatu, Radu; Cataranciuc, Sergiu (Institutul de Matematică şi Informatică al Academiei de Ştiinţe a Moldovei, 2018)

  In this paper we prove that it is NP-complete to decide whet- her a graph can be partitioned into nontrivial convex sets. We show that it can be verified in polynomial time whether a graph can be covered by nontrivial ...
• SECURITATEA REȚELELOR INFORMATICE 

  Bragaru, Tudor; Malcoci, Viorel; Galaicu, Valeriu (CEP USM, 2017)

  n condiţiile utilizării în masă a reţelelor informatice şi desfăşurării diverselor activităţi profesionale mediate de reţele şi dispozitivele mobile conectate, conştientizarea şi contracararea riscurilor devine foarte ...
• MODELAREA FUNCŢIONĂRII DIODEI SEMICONDUCTOARE PENTRU CAZUL UNIDIMENSIONAL 

  Sprincean, Galina (CEP USM, 2017)

  Problema constă în determinarea parametrilor pentru o diodă semiconductoare. Formularea matematică a problemei se bazează pe modelul Drift-Diffusion. Modelul este dat de un set de ecuații descris cu ajutorul a trei funcții ...
• PROBLEMA FLUXULUI MAXIM ÎN REȚELE – ANALIZA ȘI SINTEZA ALGORITMILOR DE SOLUȚIONARE 

  Pașa, Tatiana (CEP USM, 2017)

  În lucrare se propune o prezentare generală a algoritmilor de soluționare a problemei fluxului maxim în rețele de transport. Sunt descrise tehnicile de bază utilizate de-a lungul timpului începând cu primul algoritm propus ...
• MODELAREA EXPERIMENTELOR ALEATOARE ȘI FORMAREA GÂNDIRII PROBABILISTE LA ELEV 

  Poștaru, Andrei; Benderschi, Olga (CEP USM, 2017)

  În scopul formării gândirii probabiliste la elevi se propune un sistem complex de exerciţii (rezolvate sau propuse spre rezolvare). În principiu, aici este vorba de spre exerciţii care se referă la experimente aleatoare ...
• NUMERICAL METHOD FOR CALCULATING ELECTRICAL POWER IN A MULTIWIRE TRANSMISSION LINE 

  Pațiuc, Vladimir; Rîbacova, Galina (CEP USM, 2017)

  Transmission line equations are considered for a system consisting of an arbitrary number of electrical conductors. The numerical technique based on finite difference approximation is proposed. First, the original system ...
• THE STABILITY ANALYSIS OF APPROXIMATE SCHEMES FOR THE PLANE FRACTIONAL ORDER DIFFUSION EQUATION 

  Secrieru, Ivan (CEP USM, 2017)

  The evolution equation of fractional order by the space variables is considered in this paper. This equation models the diffusion factor in the process to transport any substance in some medium. An approximate scheme to ...
• FUZZY MULTICRITERIAL OPTIMIZATIONS IN THE TRANSPORTATION PROBLEM 

  Tkacenko, Alexandra (CEP USM, 2017)

  In the paper an iterative fuzzy programming approach for solving the multi-objective transportation problem of ”bottleneck”type with some imprecise data is developed. Minimizing the worst upper bound to obtain an efficient ...
• FINDING THE SET OF ALL NASH EQUILIBRIA OF A POLYMATRIX MIXED-STRATEGY GAME 

  Ungureanu, Valeriu (CEP USM, 2017)

  The method of intersection of best response mapping graphs is applied to determine the Nash equilibrium set of a finite mixedstrategy game. Results of a Wolfram language implementation of the method are presented. Appeared ...
• IMAGES PROCESSING TOOLS FOR DATA MEASUREMENTS FROM INTERFEROGRAMS 

  Arnaut, Vsevolod; Andrieș, Ion (CEP USM, 2017)

  The imaging interferometry analyzing methods based on software processing of interferograms possess unique potential capabilities in domain of precise measurements. This paper presents ...
• APPLYING SEQUENTIAL AND PARALLEL PROGRAMMING TO SOLVE ANON-LINEAR TRANSPORTATION PROBLEM 

  Pașa, Tatiana; Ungureanu, Valeriu (UTM, 2017)

  Some aspects related to the structure of anon-linear network transport ation problem are investigated. An improve ment of an algorithm proposed earlier is provided by the means of sequential and parallel programming ...
• ADAPTIVE APPLICATION FOR COMPLEX SYSTEMS MODELING 

  Căpățână, Gheorghe; Ciobu, Victor; Paladi, Florentin (CEP USM, 2017)

  The paper presents a formal system for presentation and measurement of applications adaptability, and describes an original methodology for building adaptive applications from various fields of activity/research, ...
• WOLFRAM MATHEMATICA AS AN ENVIRONMENT FOR SOLVING CONCAVE NETWORK TRANSPORTATION PROBLEMS 

  Pașa, Tatiana; Ungureanu, Valeriu (CEP USM, 2017)

  In this work, we consider a transportation problem on a network with concave cost functions and constrained flows on arcs and expose an approach to its solving via Wolfram language algorithm implementation ...
• INPUT-OUTPUT MODEL FOR REPUBLIC OF MOLDOVA 

  Naval, Elvira; Ghereg, Veronica (CEP USM, 2017)

  The twenty three aggregated brunches of the Moldovan economy are considered. Squared 23x23 direct expenditure coefficients matrix was constructed. Optimization problem dealing with price energy growing impact on the final ...
• PARALLEL ALGORITHM TO FIND THE BAYES-NASH SOLUTION IN THE INFORMATIONAL EXTENDED GAME 

  Hancu, Boris (2017)

  The Bayes-Nash solutions for informational extended games are discussed. Also the parallel algorithm for mixed system with shared and distributed memory to determine the Bayes-Nash solutions in the bimatrix informational ...
• PARALLEL ALGORITHM TO SOLVE THE BIMATRICEAL SUBGAMES GENERATED BY THE INFORMATIONAL EXTENDED STRATEGIES 

  Gladei, Anatol (CEP USM, 2017)

  Parallel algorithm for mixed system with shared and distributed memory to solve bimatrix game generated by the informational extended strategies is described.
• dm-CONVEX FUNCTIONS IN THE COMPLEX OF MULTI-ARY RELATIONS 

  Cataranciuc, Sergiu; Braguța, Galina (2017)

  In the present work the notions of dm-convexity and dm convex function are defined. Some properties of these functions are mentioned. We study the complexes of multi-ary relations for which the median function is dm-convex.
• MAXIMUM NONTRIVIAL CONVEX COVER OF A TREE 

  Buzatu, Radu (CEP USM, 2017)

  The nontrivial convex p-cover problem of a tree is studied.We propose the recursive formula that determines the maximum nontrivial convex cover number of a tree.
• ALGORITHM FOR THE LOCALIZATION OF SINGULARITIES OF FUNCTIONS DEFINED ON CLOSED CONTOURS 

  Capcelea, Maria; Capcelea, Titu (CEP USM, 2017)

  A numerical algorithm for locating polar singularities of functions defined on a discrete set of points of a simple closed contour in the complex plane is examined. The algorithm uses the Faber-Pad ́e approximation of ...

View more