126 search results - page 20 / 26 » Improving heuristic mini-max search by supervised learning |
DAC
2003
ACM
14 years 8 months ago
2003
ACM
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
AIPS
2008
13 years 10 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...