Книга: Lev Kazakovtsev «Parallel Random Search Algorithm»
|
Производитель: "LAP Lambert Academic Publishing" 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... ISBN:9783843317214 Издательство: "LAP Lambert Academic Publishing" (2011)
ISBN: 9783843317214 |
См. также в других словарях:
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Memetic algorithm — Memetic algorithms (MA) represent one of the recent growing areas of research in evolutionary computation. The term MA is now widely used as a synergy of evolutionary or any population based approach with separate individual learning or local… … Wikipedia
List of algorithm general topics — This is a list of algorithm general topics, by Wikipedia page. * Analysis of algorithms * Ant colony algorithm * Approximation algorithm * Best and worst cases * Big O notation * Combinatorial search * Competitive analysis * Computability theory… … Wikipedia
Stochastic Diffusion Search — (SDS), was first described in 1989 as a population based, pattern matching algorithm [Bishop, 1989] . It belongs to a family of Swarm Intelligence and naturally inspired search and optimisation algorithms which includes Ant Colony Optimization,… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
