1343 search results - page 36 / 269 » Learning to Complete Sentences |
128
click to vote
ICGI
1998
Springer
15 years 5 months ago
1998
Springer
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
103
click to vote
AAAI
1993
15 years 2 months ago
1993
Automating the construction of semantic grammars is a di cult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be vi...
113
click to vote
AGENTS
1997
Springer
15 years 5 months ago
1997
Springer
We have been developing Rogue, an architecture that integrates high-level planning with a low-level executing robotic agent. Rogue is designed as the oce gofer task planner for X...
136
click to vote
CP
2010
Springer
14 years 11 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
ICDM
2010
IEEE
14 years 11 months ago
2010
IEEE
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...