592 search results - page 40 / 119 » Learning Generalized Plans Using Abstract Counting |
AAAI
1997
14 years 11 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
106
click to vote
HRI
2011
ACM
14 years 1 months ago
2011
ACM
In this paper, we present an approach to monitor human activities such as entry, exit and break times of people in a workplace environment. The companion robot then learns the use...
PDSE
2000
14 years 11 months ago
2000
The aim of this paper is to describe a generic interface through which a planning tool or design aid can be connected to a telecommunications network. In today's complex and ...
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Inverse reinforcement learning addresses the general problem of recovering a reward function from samples of a policy provided by an expert/demonstrator. In this paper, w...
AIPS
2008
15 years 9 days ago
2008
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...