2612 search results - page 84 / 523 » Assemblies as Graph Processes |
GG
2008
Springer
13 years 11 months ago
2008
Springer
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...
JCT
2007
13 years 10 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
EWSA
2006
Springer
14 years 1 months ago
2006
Springer
Assembling software components into an architecture is a difficult task because of its combinatorial complexity. There is thus a need for automating this building process, either t...
ACL
2008
13 years 11 months ago
2008
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
INFOCOM
2012
IEEE
12 years 15 days ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...