Sciweavers

13917 search results - page 129 / 2784
» Abstraction of Probabilistic Systems
Sort
View
SUM
2007
Springer
15 years 4 months ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...
ICRA
2010
IEEE
127views Robotics» more  ICRA 2010»
14 years 8 months ago
Probabilistically complete planning with end-effector pose constraints
Abstract— We present a proof for the probabilistic completeness of RRT-based algorithms when planning with constraints on end-effector pose. Pose constraints can induce lowerdime...
Dmitry Berenson, Siddhartha S. Srinivasa
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
14 years 8 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
SIGMOD
2006
ACM
156views Database» more  SIGMOD 2006»
15 years 10 months ago
MauveDB: supporting model-based user views in database systems
Real-world data -- especially when generated by distributed measurement infrastructures such as sensor networks -- tends to be incomplete, imprecise, and erroneous, making it impo...
Amol Deshpande, Samuel Madden
PODC
2004
ACM
15 years 3 months ago
Signed quorum systems
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
Haifeng Yu