Parallel Random Search Algorithm: Of Constrained Pseudo-Boolean Optimization for Large-scale Problems - Softcover
Synopsis
Random search methods are implemented to solve the wide variety of the large-scale discrete optimization problems when the implementation of the exact solution approaches is impossible due to large computational demands. Initially designed for unconstrained optimization, the variant probabilities method allows us to find the approximate solution of pseudo-Boolean optimization problems with constraints. Although, in case of the large-scale problems, the computational demands are also very high and the precision of the result depends on the spent time. The rapid development of the parallel processor systems and clusters allows to reduce significantly the time spent to find the acceptable solution with speed-up close to ideal. In this paper, we consider an approach to the parallelizing of the algorithms realizing the variant probability method with adaptation and partial rollback procedure for constrained pseudo-Boolean optimization problems. Existing optimization algorithms are adapted for the systems with shared memory (OpenMP) and cluster systems (MPI library). The parallel efficiency is estimated for the large-scale non-linear pseudo-Boolean optimization problems.
"synopsis" may belong to another edition of this title.
About the Author
Lev Alexaksandrovich Kazakovtsev, Ph.D. in Engineering, Associate Professor of the Institute of Management and Informatics of the Krasnoyarsk State Agrarian University.
"About this title" may belong to another edition of this title.
Search results for Parallel Random Search Algorithm: Of Constrained Pseudo-Bool...
Seller Image
Parallel Random Search Algorithm
Published by
LAP LAMBERT Academic Publishing Sep 2011, 2011
ISBN 10: 3843317216
ISBN 13: 9783843317214
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Random search methods are implemented to solve the wide variety of the large-scale discrete optimization problems when the implementation of the exact solution approaches is impossible due to large computational demands. Initially designed for unconstrained optimization, the variant probabilities method allows us to find the approximate solution of pseudo-Boolean optimization problems with constraints. Although, in case of the large-scale problems, the computational demands are also very high and the precision of the result depends on the spent time. The rapid development of the parallel processor systems and clusters allows to reduce significantly the time spent to find the acceptable solution with speed-up close to ideal. In this paper, we consider an approach to the parallelizing of the algorithms realizing the variant probability method with adaptation and partial rollback procedure for constrained pseudo-Boolean optimization problems. Existing optimization algorithms are adapted for the systems with shared memory (OpenMP) and cluster systems (MPI library). The parallel efficiency is estimated for the large-scale non-linear pseudo-Boolean optimization problems. 60 pp. Englisch. Seller Inventory # 9783843317214
Buy New
US$ 58.76
US$ 26.78 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
Parallel Random Search Algorithm
Published by
LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3843317216
ISBN 13: 9783843317214
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Kazakovtsev LevLev Alexaksandrovich Kazakovtsev, Ph.D. in Engineering, Associate Professor of the Institute of Management and Informatics of the Krasnoyarsk State Agrarian University.Random search methods are implemented to solve. Seller Inventory # 5464900
Buy New
US$ 49.22
US$ 57.04 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Parallel Random Search Algorithm
Published by
LAP LAMBERT Academic Publishing Sep 2011, 2011
ISBN 10: 3843317216
ISBN 13: 9783843317214
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware -Random search methods are implemented to solve the wide variety of the large-scale discrete optimization problems when the implementation of the exact solution approaches is impossible due to large computational demands. Initially designed for unconstrained optimization, the variant probabilities method allows us to find the approximate solution of pseudo-Boolean optimization problems with constraints. Although, in case of the large-scale problems, the computational demands are also very high and the precision of the result depends on the spent time. The rapid development of the parallel processor systems and clusters allows to reduce significantly the time spent to find the acceptable solution with speed-up close to ideal. In this paper, we consider an approach to the parallelizing of the algorithms realizing the variant probability method with adaptation and partial rollback procedure for constrained pseudo-Boolean optimization problems. Existing optimization algorithms are adapted for the systems with shared memory (OpenMP) and cluster systems (MPI library). The parallel efficiency is estimated for the large-scale non-linear pseudo-Boolean optimization problems.Books on Demand GmbH, Überseering 33, 22297 Hamburg 60 pp. Englisch. Seller Inventory # 9783843317214
Buy New
US$ 58.76
US$ 69.85 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
Parallel Random Search Algorithm : Of Constrained Pseudo-Boolean Optimization for Large-scale Problems
Published by
LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3843317216
ISBN 13: 9783843317214
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Random search methods are implemented to solve the wide variety of the large-scale discrete optimization problems when the implementation of the exact solution approaches is impossible due to large computational demands. Initially designed for unconstrained optimization, the variant probabilities method allows us to find the approximate solution of pseudo-Boolean optimization problems with constraints. Although, in case of the large-scale problems, the computational demands are also very high and the precision of the result depends on the spent time. The rapid development of the parallel processor systems and clusters allows to reduce significantly the time spent to find the acceptable solution with speed-up close to ideal. In this paper, we consider an approach to the parallelizing of the algorithms realizing the variant probability method with adaptation and partial rollback procedure for constrained pseudo-Boolean optimization problems. Existing optimization algorithms are adapted for the systems with shared memory (OpenMP) and cluster systems (MPI library). The parallel efficiency is estimated for the large-scale non-linear pseudo-Boolean optimization problems. Seller Inventory # 9783843317214
Buy New
US$ 58.76
US$ 70.48 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Parallel Random Search Algorithm | Of Constrained Pseudo-Boolean Optimization for Large-scale Problems
Published by
LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3843317216
ISBN 13: 9783843317214
New
Taschenbuch
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Parallel Random Search Algorithm | Of Constrained Pseudo-Boolean Optimization for Large-scale Problems | Lev Kazakovtsev | Taschenbuch | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783843317214 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Seller Inventory # 106794211
Buy New
US$ 51.93
US$ 81.50 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 5 available
Stock Image
Parallel Random Search Algorithm: Of Constrained Pseudo-Boolean Optimization for Large-scale Problems
Published by
LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3843317216
ISBN 13: 9783843317214
Used
Paperback
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA77338433172166
Buy Used
US$ 132.76
US$ 33.57 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available