293 search results - page 9 / 59 » Reasoning About States of Probabilistic Sequential Programs |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Parallel programming continues to be difficult, despite substantial and ongoing research aimed at making it tractable. Especially dismaying is the gulf between theory and the pract...
KBSE
2007
IEEE
14 years 1 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
ECSQARU
2003
Springer
14 years 21 days ago
2003
Springer
We introduce a set of transformations on the set of all probability distributions over a finite state space, and show that these transformations are the only ones that preserve c...
KI
2001
Springer
13 years 12 months ago
2001
Springer
High-level controllers that operate robots in dynamic, uncertain domains are concerned with at least two reasoning tasks dealing with the effects of noisy sensors and effectors: T...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...