272 search results - page 40 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
138
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...
180
Voted
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...
108
Voted
IWANN
2001
Springer
15 years 8 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
119
click to vote
JDA
2007
15 years 3 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
132
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....