575 search results - page 75 / 115 » Model Checking Restricted Sets of Timed Paths |
ESA
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
107
click to vote
PDP
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their ne...
102
click to vote
TON
2008
14 years 11 months ago
2008
By allowing end hosts to make independent routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes...
106
click to vote
PODS
2008
ACM
16 years 10 hour ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...