Sciweavers

882 search results - page 31 / 177
» Local Search for Very Large SAT Problems
Sort
View
CG
1998
Springer
15 years 4 months ago
Relevance Cuts: Localizing the Search
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
Andreas Junghanns, Jonathan Schaeffer
LION
2009
Springer
203views Optimization» more  LION 2009»
15 years 6 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
CPE
1997
Springer
79views Hardware» more  CPE 1997»
15 years 3 months ago
Storage Alternatives for Large Structured State Spaces
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
Gianfranco Ciardo, Andrew S. Miner
ICRA
2007
IEEE
99views Robotics» more  ICRA 2007»
15 years 6 months ago
RFID-Based Exploration for Large Robot Teams
Abstract— To coordinate a team of robots for exploration is a challenging problem, particularly in large areas as for example the devastated area after a disaster. This problem c...
Vittorio A. Ziparo, Alexander Kleiner, Bernhard Ne...
EVOW
2001
Springer
15 years 4 months ago
Design of Iterated Local Search Algorithms
In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently propo...
Matthijs den Besten, Thomas Stützle, Marco Do...