Sciweavers

914 search results - page 43 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
TACAS
2007
Springer
110views Algorithms» more  TACAS 2007»
14 years 4 months ago
Counterexamples in Probabilistic Model Checking
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
Tingting Han, Joost-Pieter Katoen
HCI
2009
13 years 8 months ago
A Computational Implementation of a Human Attention Guiding Mechanism in MIDAS v5
In complex human-machine systems, the human operator is often required to intervene to detect and solve problems. Given this increased reliance on the human in these critical human...
Brian F. Gore, Becky L. Hooey, Christopher D. Wick...
PODS
2010
ACM
159views Database» more  PODS 2010»
14 years 6 days ago
On probabilistic fixpoint and Markov chain query languages
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
Daniel Deutch, Christoph Koch, Tova Milo
AAAI
1998
13 years 11 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
PVLDB
2010
110views more  PVLDB 2010»
13 years 8 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor