Sciweavers

603 search results - page 35 / 121
» DFS-Tree Based Heuristic Search
Sort
View
IJCAI
1993
13 years 9 months ago
The Statistical Learning of Accurate Heuristics
Heuristics used by search algorithms are usually composed of more primitive functions which we call "features". A method for combining features is presented which is bas...
Anna Bramanti-Gregor, Henry W. Davis
DISOPT
2008
88views more  DISOPT 2008»
13 years 8 months ago
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...
Renato Bruni, Andrea Santori
EOR
2008
91views more  EOR 2008»
13 years 8 months ago
Dominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...
ESWA
2007
131views more  ESWA 2007»
13 years 7 months ago
Case-based selection of initialisation heuristics for metaheuristic examination timetabling
Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many...
Sanja Petrovic, Yong Yang, Moshe Dror
HEURISTICS
2008
153views more  HEURISTICS 2008»
13 years 8 months ago
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
Jakob Puchinger, Günther R. Raidl