Sciweavers

617 search results - page 1 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
ECAI
2004
Springer
13 years 10 months ago
Local Search for Heuristic Guidance in Tree Search
Recent work has shown the promise in using local-search “probes” as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next...
Alexander Nareyek, Stephen F. Smith, Christian M. ...
AI
2004
Springer
13 years 10 months ago
A Hybrid Schema for Systematic Local Search
Abstract. We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitmen...
William S. Havens, Bistra N. Dilkina
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
13 years 10 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
HEURISTICS
2006
95views more  HEURISTICS 2006»
13 years 4 months ago
Image registration with iterated local search
Oscar Cordón, Sergio Damas
EVOW
2007
Springer
13 years 11 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu