82 search results - page 2 / 17 » Extended Directed Search for Probabilistic Timed Reachabilit... |
AIPS
2007
13 years 7 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 ...
LICS
2003
IEEE
13 years 10 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...
ECCC
2010
13 years 2 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 ...
AAAI
2007
13 years 7 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
13 years 11 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...