82 search results - page 2 / 17 » Extended Directed Search for Probabilistic Timed Reachabilit... |
AIPS
2007
15 years 2 months ago
2007
Many scheduling problems reside in uncertain and dynamic environments – tasks have a nonzero probability of failure and may need to be rescheduled. In these cases, an optimized ...
164
click to vote
LICS
2003
IEEE
15 years 5 months ago
2003
IEEE
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
107
click to vote
ECCC
2010
14 years 9 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
120
click to vote
AAAI
2007
15 years 2 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
APN
2004
Springer
15 years 5 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...