2263 search results - page 81 / 453 » On learning in agent-centered search |
154
click to vote
AUSAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
140
click to vote
ICGI
1998
Springer
15 years 10 months ago
1998
Springer
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
162
click to vote
AI
2005
Springer
15 years 11 months ago
2005
Springer
This paper addresses the task of finding acronym-definition pairs in text. Most of the previous work on the topic is about systems that involve manually generated rules or regular ...
162
click to vote
CG
2006
Springer
15 years 8 months ago
2006
Springer
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
187
click to vote
CP
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...