Sciweavers

1221 search results - page 207 / 245
» Balanced graph partitioning
Sort
View
AINA
2007
IEEE
14 years 2 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
HPCC
2007
Springer
14 years 1 months ago
CDACAN: A Scalable Structured P2P Network Based on Continuous Discrete Approach and CAN
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...
Lingwei Li, Qunwei Xue, Deke Guo
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 1 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
14 years 1 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
SCAM
2006
IEEE
14 years 1 months ago
SMART C: A Semantic Macro Replacement Translator for C
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
Matthew Jacobs, E. Christopher Lewis