325 search results - page 32 / 65 » Structured Reachability Analysis for Markov Decision Process... |
124
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
162
click to vote
SPE
2002
15 years 3 months ago
2002
This study presents a practical solution for data collection and restoration to migrate a process written in high level stack-based languages such as C and Fortran over a network ...
139
click to vote
AIPS
1998
15 years 5 months ago
1998
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
149
click to vote
UML
2001
Springer
15 years 8 months ago
2001
Springer
Modern distributed software applications generally operate in complex and heterogeneous computing environments (like the World Wide Web). Different paradigms (client-server, mobili...
149
click to vote
MPC
2010
Springer
15 years 8 months ago
2010
Springer
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...