2473 search results - page 159 / 495 » The Logic of Communication Graphs |
108
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
145
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functiona...
136
Voted
CP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
101
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
—The Internet AS level topology, upon which BGP4 runs, plays a vital role in the analysis and study of the global routing behavior. However, the study of the topology itself is n...
111
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...