225 search results - page 5 / 45 » A Least-Certainty Heuristic for Selective Search |
CP
2010
Springer
13 years 7 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
CP
2004
Springer
14 years 2 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
IWANN
2005
Springer
14 years 2 months ago
2005
Springer
In this work, we suggest a new feature selection technique that lets us use the wrapper approach for finding a well suited feature set for distinguishing experiment classes in hig...
IJAMCIGI
2010
13 years 6 months ago
2010
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...
ICTAI
2009
IEEE
13 years 6 months ago
2009
IEEE
We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...