Sciweavers

402 search results - page 42 / 81
» Probability, Parallelism and the State Space Exploration Pro...
Sort
View
NIPS
2008
15 years 19 days ago
Clusters and Coarse Partitions in LP Relaxations
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
David Sontag, Amir Globerson, Tommi Jaakkola
AIPS
2009
15 years 9 days ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
93
Voted
ECAI
2010
Springer
14 years 9 months ago
Describing the Result of a Classifier to the End-User: Geometric-based Sensitivity
This paper addresses the issue of supporting the end-user of a classifier, when it is used as a decision support system, to classify new cases. We consider several kinds of classif...
Isabelle Alvarez, Sophie Martin, Salma Mesmoudi
ECP
1999
Springer
190views Robotics» more  ECP 1999»
15 years 3 months ago
Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
Avrim Blum, John Langford
AIPS
2006
15 years 18 days ago
Concurrent Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
Iain Little, Sylvie Thiébaux