Sciweavers

127 search results - page 20 / 26
» Composing Complete and Partial Knowledge
Sort
View
ATAL
2008
Springer
13 years 9 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
CAV
2008
Springer
113views Hardware» more  CAV 2008»
13 years 9 months ago
Producing Short Counterexamples Using "Crucial Events"
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
Sujatha Kashyap, Vijay K. Garg
CSCLP
2008
Springer
13 years 8 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
DAGSTUHL
2008
13 years 8 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
NIPS
2007
13 years 8 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...