1614 search results - page 18 / 323 » Learning Rules and Their Exceptions |
DAGSTUHL
2007
14 years 11 months ago
2007
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
AIPS
2010
14 years 9 months ago
2010
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...
63
Voted
COLING
2010
14 years 4 months ago
2010
This paper studies two methods for training hierarchical MT rules independently of word alignments. Bilingual chart parsing and EM algorithm are used to train bitext correspondenc...
IJCAI
1993
14 years 11 months ago
1993
One method for reducing the time required for plan generation is to learn search control rules from experience. Most of the recent work in learning search control knowledge has co...
ICML
2004
IEEE
15 years 3 months ago
2004
IEEE
While there is a lot of empirical evidence showing that traditional rule learning approaches work well in practice, it is nearly impossible to derive analytical results about thei...