Sciweavers

23 search results - page 1 / 5
» Learning Inadmissible Heuristics During Search
Sort
View
AIPS
2011
12 years 10 months ago
Learning Inadmissible Heuristics During Search
Jordan Tyler Thayer, Austin J. Dionne, Wheeler Rum...
ECAI
2000
Springer
13 years 10 months ago
Towards Real-Time Search with Inadmissible Heuristics
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
Masashi Shimbo, Toru Ishida
INFORMS
2010
125views more  INFORMS 2010»
13 years 4 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
ICTAI
2010
IEEE
13 years 4 months ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...
IJCAI
2007
13 years 7 months ago
Using Learned Policies in Heuristic-Search Planning
Many current state-of-the-art planners rely on forward heuristic search. The success of such search typically depends on heuristic distance-to-the-goal estimates derived from the ...
Sung Wook Yoon, Alan Fern, Robert Givan