820 search results - page 97 / 164 » Inducing Temporal Graphs |
120
click to vote
ICSE
2001
IEEE-ACM
15 years 7 months ago
2001
IEEE-ACM
Mocha is a model checker based on the theme of exploiting design modularity: instead of manipulating unstructured state-transition graphs, it supports the hierarchical modeling fra...
115
click to vote
OTM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...
216
click to vote
FSTTCS
2010
Springer
15 years 17 days ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
121
click to vote
JGT
2007
15 years 3 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
140
click to vote
WINET
2010
15 years 1 months ago
2010
We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node v’s routing decision only depends on knowl...