2457 search results - page 113 / 492 » Local Search with Bootstrapping |
APAL
2011
14 years 5 months ago
2011
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
100
click to vote
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...
ICRA
2006
IEEE
15 years 4 months ago
2006
IEEE
Abstract— This paper presents a search-based, real-time adaptive solution to the multi-robot coordination problem in adversarial environments. By decomposing the global coordinat...
AI
2003
Springer
15 years 3 months ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...