12825 search results - page 396 / 2565 » Improved PLSOM algorithm |
155
Voted
PDCAT
2004
Springer
16 years 24 days ago
2004
Springer
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...
157
Voted
GECCO
2000
Springer
15 years 11 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
198
Voted
SODA
2000
ACM
15 years 8 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
244
click to vote
CPM
2006
Springer
15 years 11 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
231
Voted
ESA
2008
Springer
15 years 9 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...