Sciweavers

2796 search results - page 151 / 560
» The coolest path problem
Sort
View
ICGA
1997
89views Optimization» more  ICGA 1997»
15 years 6 months ago
A Wave Analysis of the Subset Sum Problem
This paper introduces the wave model, a novel approach on analyzing the behavior of GAs. Our aim is to give techniques that have practical relevance and provide tools for improvin...
Márk Jelasity
STACS
1994
Springer
15 years 9 months ago
On the Complexity of the Maximum Cut Problem
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
Hans L. Bodlaender, Klaus Jansen
ECAI
2000
Springer
15 years 8 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
AAAI
2010
15 years 6 months ago
High-Quality Policies for the Canadian Traveler's Problem
We consider the stochastic variant of the Canadian Traveler's Problem, a path planning problem where adverse weather can cause some roads to be untraversable. The agent does ...
Patrick Eyerich, Thomas Keller, Malte Helmert
145
Voted
APPROX
2008
Springer
135views Algorithms» more  APPROX 2008»
15 years 7 months ago
The Directed Minimum Latency Problem
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
Viswanath Nagarajan, R. Ravi