Sciweavers

603 search results - page 1 / 121
» DFS-Tree Based Heuristic Search
Sort
View
AE
2007
Springer
13 years 11 months ago
Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
Mohamed Bahy Bader-El-Den, Riccardo Poli
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. ...
HEURISTICS
2002
152views more  HEURISTICS 2002»
13 years 4 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
SARA
2007
Springer
13 years 11 months ago
DFS-Tree Based Heuristic Search
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
Montserrat Abril, Miguel A. Salido, Federico Barbe...