1753 search results - page 149 / 351 » Reducibility of domain representations and Cantor-Weihrauch ... |
121
click to vote
AIPS
2007
15 years 4 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
110
click to vote
AIPS
2000
15 years 3 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
114
Voted
IJCAI
1989
15 years 3 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
114
click to vote
COLING
1990
15 years 3 months ago
1990
Lexicalized Tree Adjoining Grammar (LTAG) is an attractive formalism for linguistic description mainly because cff its extended domain of locality and its factoring recursion out ...
108
Voted
ECML
1998
Springer
15 years 6 months ago
1998
Springer
We present compelling evidence that the World Wide Web is a domain in which applications can benefit from using first-order learning methods, since the graph structure inherent in ...