Sciweavers

1310 search results - page 15 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
SEAL
2010
Springer
13 years 5 months ago
A Parallel Algorithm for Solving Large Convex Minimax Problems
Ramnik Arora, Utkarsh Upadhyay, Rupesh Tulshyan, J...
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
14 years 1 months ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
IPPS
2005
IEEE
14 years 1 months ago
Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools
We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel a...
Holger Blaar, Thomas Lange, Renate Winter, Marcel ...
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
14 years 21 days ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...