208 search results - page 23 / 42 » Evolutionary algorithms and multi-objectivization for the tr... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
IPPS
2002
IEEE
14 years 19 days ago
2002
IEEE
We introduce a new method to estimate the Java object activity in a distributed context of irregular applications. This method uses an observation mechanism which is itself a part...
FPGA
2006
ACM
13 years 11 months ago
2006
ACM
In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...