Sciweavers

298 search results - page 28 / 60
» A probabilistic approach to default reasoning
Sort
View
AIPS
2006
15 years 7 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
15 years 3 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
AI
2008
Springer
15 years 6 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
STAIRS
2008
169views Education» more  STAIRS 2008»
15 years 7 months ago
Probabilistic Association Rules for Item-Based Recommender Systems
Since the beginning of the 1990's, the Internet has constantly grown, proposing more and more services and sources of information. The challenge is no longer to provide users ...
Sylvain Castagnos, Armelle Brun, Anne Boyer
SIGIR
2008
ACM
15 years 6 months ago
Discriminative probabilistic models for passage based retrieval
The approach of using passage-level evidence for document retrieval has shown mixed results when it is applied to a variety of test beds with different characteristics. One main r...
Mengqiu Wang, Luo Si