1343 search results - page 97 / 269 » Learning to Complete Sentences |
142
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
135
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Reinforcement learning in real-world domains suffers from three curses of dimensionality: explosions in state and action spaces, and high stochasticity. We present approaches that ...
140
click to vote
AAAI
2010
15 years 5 months ago
2010
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
152
click to vote
FLAIRS
2007
15 years 6 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
133
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
This paper presents a scalable solution to the problem of tracking objects across spatially separated, uncalibrated, non-overlapping cameras. Unlike other approaches this technique...