126 search results - page 3 / 26 » Improving heuristic mini-max search by supervised learning |
ICTAI
2010
IEEE
13 years 3 months ago
2010
IEEE
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...
IJCAI
2007
13 years 7 months ago
2007
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 ...
PLDI
2003
ACM
13 years 11 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...
EMNLP
2009
13 years 3 months ago
2009
Most existing information retrieval (IR) systems do not take much advantage of natural language processing (NLP) techniques due to the complexity and limited observed effectivenes...