Sciweavers

617 search results - page 18 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
54
Voted
GECCO
2006
Springer
128views Optimization» more  GECCO 2006»
15 years 1 months ago
Maximum cardinality matchings on trees by randomized local search
Oliver Giel, Ingo Wegener
87
Voted
AI
2002
Springer
14 years 9 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
EVOW
2010
Springer
15 years 1 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
IJCAI
1997
14 years 11 months ago
Automatic Generation of Heuristics for Scheduling
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
Robert A. Morris, John L. Bresina, Stuart M. Rodge...
FLAIRS
2004
14 years 11 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever