Sciweavers

243 search results - page 8 / 49
» On Balanced Graphs
Sort
View
CORR
2010
Springer
57views Education» more  CORR 2010»
14 years 7 months ago
Balancing congestion for unsplittable routing on a bidirected ring
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
Johanna Becker, Zsolt Csizmadia, Alexandre Laugier...
FLAIRS
2006
14 years 11 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
PDP
2003
IEEE
15 years 2 months ago
Load Balancing for Spatial-grid-based Parallel Numeric Simulations on Clusters of SMPs
Load distribution is an essential factor to parallel efficiency of numerical simulations that are based on spatial grids, especially on clusters of symmetric multiprocessors (SMPs...
Huaien Gao, Andreas Schmidt, Amitava Gupta, Peter ...
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
14 years 9 months ago
Weighted Zeta Functions of Graph Coverings
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
Iwao Sato
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
15 years 3 months ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...