P. M. Pardalos – författare
Visar alla böcker från författaren P. M. Pardalos. Handla med fri frakt och snabb leverans.
5 produkter
Satisfiability Problem
Theory and Applications
Av Ding-Zhu Du, Jun Gu m. fl.
Inbunden, 1997
2569 kr
Lägg i varukorg
The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to bring together work by the best theorists, …
Biocomputing
Av P. M. Pardalos, Panos M. Paralos m. fl.
Inbunden, 2002
1127 kr
Lägg i varukorg
In the quest to understand and model healthy or sick human body functions, researchers and medical doctors are utilizing more and more quantitative tools and techniques. This trend is advancing the development of the new field of biomedical computing, which is an interface between signal …
Statistical Analysis of Graph Structures in Random Variable Networks
Av V. A. Kalyagin, A. P. Koldanov m. fl.
Häftad, 2020
551 kr
Lägg i varukorg
This book studies complex systems with elements represented by random variables. Its main goal is to study and compare uncertainty of algorithms of network structure identification with applications to market network analysis. For this, a mathematical model of random variable network is introduced, …
Statistical Analysis of Graph Structures in Random Variable Networks
Av P. M. Pardalos, P. A. Koldanov m. fl.
E-bok, 2020
718 kr
Lägg i varukorg
This book studies complex systems with elements represented by random variables. Its main goal is to study and compare uncertainty of algorithms of network structure identification with applications to market network analysis. For this, a mathematical model of random variable network is introduced, …
NETWORK OPTIMIZATION PROBLEMS: ALGORITHMS, APPLICATIONS AND COMPLEXITY
Av ARDALOS M PARDALOS ARDALOS D Z DU, D Z Du m. fl.
Inbunden, 1993
2509 kr
Lägg i varukorg
In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow problems.Network …