Sciweavers

350 search results - page 30 / 70
» Complexity of Planning with Partial Observability
Sort
View
FSR
2003
Springer
94views Robotics» more  FSR 2003»
14 years 2 months ago
Planning under Uncertainty for Reliable Health Care Robotics
We describe a mobile robot system, designed to assist residents of an retirement facility. This system is being developed to respond to an aging population and a predicted shortage...
Nicholas Roy, Geoffrey J. Gordon, Sebastian Thrun
IJCAI
2003
13 years 10 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
14 years 3 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod
ATAL
2008
Springer
13 years 11 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
ALDT
2011
Springer
262views Algorithms» more  ALDT 2011»
12 years 9 months ago
Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach
Abstract. We develop a Bayesian approach to concept learning for crowdsourcing applications. A probabilistic belief over possible concept definitions is maintained and updated acc...
Paolo Viappiani, Sandra Zilles, Howard J. Hamilton...