313 search results - page 40 / 63 » Complete Local Search with Memory |
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
WOB
2004
13 years 11 months ago
2004
There are many bioinformatics tools that deal with input/ output (I/O) issues by using filing systems from the most common operating systems, such as Linux or MS Windows. However, ...
FROCOS
2009
Springer
14 years 1 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
AAAI
2008
14 years 6 days ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
ATAL
2008
Springer
13 years 12 months ago
2008
Springer
This paper describes an autonomous robot system designed to solve the challenging task of geocaching. Geocaching involves locating a goal object in an outdoor environment given on...