Sciweavers

1146 search results - page 190 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
NIPS
2007
13 years 11 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
UAI
2008
13 years 11 months ago
Church: a language for generative models
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
Noah Goodman, Vikash K. Mansinghka, Daniel M. Roy,...
WONTO
2008
13 years 11 months ago
Personalized Reliable Web service Compositions
Nowadays Internet is anywhere and users can find all possible information. In this situation, the new challenge is to provide the right information at the right time. As Web servic...
Daniela Barreiro Claro, Oriana Licchelli, Patrick ...
AAAI
2004
13 years 11 months ago
SOFIA's Choice: An AI Approach to Scheduling Airborne Astronomy Observations
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
Jeremy Frank, Michael A. K. Gross, Elif Kürkl...
AAAI
2004
13 years 11 months ago
Ergonomics Analysis for Vehicle Assembly Using Artificial Intelligence
In this paper we discuss a deployed application at Ford Motor Company that utilizes AI technology for the analysis of potential ergonomic concerns at our assembly plants. The manu...
Nestor Rychtyckyj