Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques
 |
|
Описание:
Solving combinatorial optimization problems can often lead to runtime growing exponentially as a function of the input size. But important real-world problems, industrial applications, and academic research challenges, may demand exact optimal solutions. In such situations, parallel processing can reduce the runtime from days or months, typical when one workstation is used, to a few minutes or even seconds. Partners of the CEC-sponsored SCOOP Project (Solving Combinatorial Optimization Problems in Parallel) contributed, on invitation, to this book; much attention was paid to competent coverage of the topic and the style of writing. Readers will include students, scientists, engineers, and professionals interested in the design and implementation of parallel algorithms for solving combinatorial optimization problems.Похожие книги
 | Cross Platform Development in C++ Автор: Syd Logan Год: 2007 |
 | Computing in Object-Oriented Parallel Environments, 2 conf., ISCOPE 98 Автор: Nm.) Iscope 98 (2nd : 1998 : Santa Fe Год: 1998 |
 | Adobe Integrated Runtime Год: 2011 |
| Sams Teach Yourself the C# Language in 21 Days Автор: Bradley J. Год: 2003 |
 | Abstract Computing Machines Автор: W. Kluge Год: 2004 |
 | Runtime Verification: 9th International Workshop, RV 2009, Grenoble, France, June 26-28, 2009, Selected Papers (Lecture Notes in Computer Science / Programming and Software Engineering) Автор: Saddek Bensalem, Doron A. Peled Год: 2009 |