350 search results - page 66 / 70 » Complexity of Planning with Partial Observability |
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
IACR
2011
12 years 7 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
CHI
2004
ACM
14 years 8 months ago
2004
ACM
This chapter introduces the concept of multi-modal interaction and our findings related to the development of biomedical applications for two different projection modalities: virtu...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— In this paper we predict the amount of slip an exploration rover would experience using stereo imagery by learning from previous examples of traversing similar terrain. To do t...