Sciweavers

1095 search results - page 158 / 219
» Preprocessing of Intractable Problems
Sort
View
AIPS
2008
14 years 1 months ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams
FLAIRS
2008
14 years 1 months ago
Learning in the Lexical-Grammatical Interface
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
Tom Armstrong, Tim Oates
ATAL
2008
Springer
14 years 20 days ago
Exploiting locality of interaction in factored Dec-POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provabl...
Frans A. Oliehoek, Matthijs T. J. Spaan, Shimon Wh...
ATAL
2010
Springer
13 years 11 months ago
Scalable mechanism design for the procurement of services with uncertain durations
In this paper, we study a service procurement problem with uncertainty as to whether service providers are capable of completing a given task within a specified deadline. This typ...
Enrico Gerding, Sebastian Stein, Kate Larson, Alex...
IJAR
2006
125views more  IJAR 2006»
13 years 10 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson