Sciweavers

1639 search results - page 70 / 328
» Anytime Heuristic Search
Sort
View
125
Voted
AMC
2008
106views more  AMC 2008»
15 years 4 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
IJHIS
2007
89views more  IJHIS 2007»
15 years 3 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
AI
2004
Springer
15 years 9 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
HEURISTICS
2008
153views more  HEURISTICS 2008»
15 years 3 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
ICGA
2007
85views Optimization» more  ICGA 2007»
15 years 3 months ago
Searching Solitaire in Real Time
This article presents a new real-time heuristic search method for planning problems with distinct stages. Our multistage nested rollout algorithm allows the user to apply separate...
Ronald Bjarnason, Prasad Tadepalli, Alan Fern