Kazakovtsev Lev (6 results)
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 38.47
£ 60.39 shippingShips from Germany to U.S.A.Quantity: 5 available
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 Osna…brück, mail[at]preigu[dot]de | Anbieter: preigu.
- Softcover
Seller: Mispah books, Redhill, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 101.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by LAP LAMBERT Academic Publishing Sep 2011 2011
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 43.54
£ 19.84 shippingShips from Germany to U.S.A.Quantity: 2 available
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 d…esigned 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.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 36.47
£ 42.26 shippingShips from Germany to U.S.A.Quantity: Over 20 available
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 metho…ds are implemented to solve.
Language: English
Published by LAP LAMBERT Academic Publishing Sep 2011 2011
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 43.54
£ 51.76 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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 desig…ned 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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 60 pp. Englisch.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 43.54
£ 52.22 shippingShips from Germany to U.S.A.Quantity: 1 available
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 design…ed 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.
