Sciweavers

85 search results - page 6 / 17
» Multi-Level Probabilistic Relaxation
Sort
View
IJCAI
1989
13 years 9 months ago
A Probabilistic Approach to Marker Propagation
Potentially, the advantages of marker-passing over local connectionist techniques for associa­ tive inference are (1) the ability to differen­ tiate variable bindings, and (2) r...
Dekai Wu
AIPS
2006
13 years 9 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
QEST
2008
IEEE
14 years 2 months ago
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
Josée Desharnais, François Laviolett...
AI
2008
Springer
13 years 7 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
ENGL
2007
110views more  ENGL 2007»
13 years 7 months ago
A Comparative Study of Probabilistic and Worst-case Tolerance Synthesis
— The tolerance design directly influences the functionality of products and production costs. Tolerance synthesis is a procedure that distributes assembly tolerances between com...
Jirarat Teeravaraprug