Sciweavers

128 search results - page 12 / 26
» Parallel Simulated Annealing Algorithm for Graph Coloring Pr...
Sort
View
SPDP
1991
IEEE
14 years 14 days ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
IPPS
2003
IEEE
14 years 2 months ago
A Genetic Approach to Planning in Heterogeneous Computing Environments
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
EUROPAR
2006
Springer
14 years 19 days ago
A Practical Approach of Diffusion Load Balancing Algorithms
In this paper, a practical approach of diffusion load balancing algorithms and its implementation are studied. Three problems are investigated. The first one is the determination ...
Emmanuel Jeannot, Flavien Vernier
ICCV
2003
IEEE
14 years 11 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
IEAAIE
2005
Springer
14 years 2 months ago
The Coordination of Parallel Search with Common Components
The preservation of common components has been recently isolated as a beneficial feature of genetic algorithms. One interpretation of this benefit is that the preservation of commo...
Stephen Chen, Gregory Pitt