2612 search results - page 85 / 523 » Assemblies as Graph Processes |
169
Voted
ACSD
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the paral...
186
click to vote
JSS
2008
15 years 6 months ago
2008
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
162
click to vote
FCCM
2006
IEEE
16 years 23 days ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
175
click to vote
ICNP
2007
IEEE
16 years 1 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
130
click to vote
RSA
2006
15 years 6 months ago
2006
: Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be vertices. An earlier paper (J. Van den Berg and J. Kahn, Ann Probab 29 (2001), 1...