Sciweavers

13987 search results - page 136 / 2798
» The Two Guards Problem
Sort
View
122
Voted
IPPS
2007
IEEE
15 years 9 months ago
Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows
Abstract—In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CV...
Andreas Beham
131
Voted
ICLP
2005
Springer
15 years 9 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
137
Voted
ESA
2003
Springer
140views Algorithms» more  ESA 2003»
15 years 8 months ago
Improved Approximation of the Stable Marriage Problem
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
Magnús M. Halldórsson, Kazuo Iwama, ...
DATE
2002
IEEE
112views Hardware» more  DATE 2002»
15 years 8 months ago
Global Optimization Applied to the Oscillator Problem
The oscillator problem consists of determining good initial values for the node voltages and the frequency of oscillation and the avoidance of the DC solution. Standard approaches...
S. Lampe, S. Laur
141
Voted
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 7 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...