325 search results - page 15 / 65 » Structured Reachability Analysis for Markov Decision Process... |
130
click to vote
SAFECOMP
1998
Springer
15 years 7 months ago
1998
Springer
A method is described for the analysis and the verification of safety in software systems. The method offers a formal notation for describing the software structure, the means for ...
158
click to vote
PRICAI
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
137
Voted
ICCAD
2001
IEEE
16 years 24 days ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
152
click to vote
ICTAI
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--The difficulties encountered in sequential decisionmaking problems under uncertainty are often linked to the large size of the state space. Exploiting the structure of th...
138
click to vote
SIGMETRICS
2006
ACM
15 years 10 months ago
2006
ACM
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...