198 search results - page 26 / 40 » Reachability on prefix-recognizable graphs |
CIKM
2006
Springer
14 years 1 months ago
2006
Springer
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
ISCAS
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
FM
1999
Springer
14 years 2 months ago
1999
Springer
We present novel techniques for efficient controller synthesis for untimed and timed systems with respect to invariance and reachability properties. In the untimed case, we give al...
DIALM
2005
ACM
13 years 11 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
FORMATS
2010
Springer
13 years 7 months ago
2010
Springer
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...