1120 search results - page 11 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
64
Voted
IWINAC
2005
Springer
15 years 3 months ago
2005
Springer
The evolutionary algorithms can be considered as a powerful and interesting technique for solving large kinds of control problems. However, the great disadvantage of the evolutiona...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
88
Voted
CEC
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract. In this paper, we present self-avoiding walks as a novel technique to linearize" a triangular mesh. Unlike space- lling curves which are based on a geometric embeddi...
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...