Sciweavers

592 search results - page 40 / 119
» Learning Generalized Plans Using Abstract Counting
Sort
View
AAAI
1997
13 years 9 months ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
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...
Roberto J. Bayardo Jr., Robert Schrag
HRI
2011
ACM
12 years 12 months ago
Managing social constraints on recharge behaviour for robot companions using memory
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...
Amol A. Deshmukh, Mei Yii Lim, Michael Kriegel, Ru...
PDSE
2000
96views more  PDSE 2000»
13 years 9 months ago
Applying Distributed Object Technology to Network Planning
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 ...
Tertius D. Wessels, Judy M. Bishop
PKDD
2009
Springer
181views Data Mining» more  PKDD 2009»
14 years 3 months ago
Active Learning for Reward Estimation in Inverse Reinforcement Learning
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...
Manuel Lopes, Francisco S. Melo, Luis Montesano
AIPS
2008
13 years 10 months ago
Structural Patterns Heuristics via Fork Decomposition
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...
Michael Katz, Carmel Domshlak