6939 search results - page 165 / 1388 » Algorithm Engineering for Parallel Computation |
NOSSDAV
2009
Springer
14 years 2 months ago
2009
Springer
A critical problem in implementing interactive perception applications is the considerable computational cost of current computer vision and machine learning algorithms, which typ...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
PVM
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
NC
1998
13 years 9 months ago
1998
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...