Sciweavers

617 search results - page 15 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
82
Voted
ECAI
2008
Springer
14 years 11 months ago
Justification-Based Non-Clausal Local Search for SAT
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 1 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
14 years 11 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
ICNC
2005
Springer
15 years 3 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
EVOW
2009
Springer
15 years 4 months ago
Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
Steffen Wolf, Peter Merz