1830 search results - page 191 / 366 » Workshop on Graph Computation Models |
130
click to vote
CIBCB
2007
IEEE
16 years 12 days ago
2007
IEEE
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...
185
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
134
click to vote
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
164
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
194
click to vote
ADHOCNOW
2004
Springer
15 years 11 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...