Sciweavers

CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 11 months ago
Analyzing Walksat on random formulas
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
Amin Coja-Oghlan, Alan M. Frieze
JAR
2000
123views more  JAR 2000»
13 years 7 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 7 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
13 years 8 months ago
Precision, local search and unimodal functions
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
AAAI
1997
13 years 8 months ago
The Scaling of Search Cost
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby...
AAAI
2004
13 years 8 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml
AAAI
2008
13 years 9 months ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan
PVM
2004
Springer
14 years 15 days ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...
GECCO
2004
Springer
148views Optimization» more  GECCO 2004»
14 years 16 days ago
Evolving Local Search Heuristics for SAT Using Genetic Programming
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
Alex S. Fukunaga
UIST
2006
ACM
14 years 1 months ago
Viz: a visual analysis suite for explaining local search behavior
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
Steven Halim, Roland H. C. Yap, Hoong Chuin Lau