Sciweavers

243 search results - page 9 / 49
» On Balanced Graphs
Sort
View
82
Voted
IPPS
1999
IEEE
15 years 1 months ago
Scalable Parallelization of Harmonic Balance Simulation
Abstract. A new approach to parallelizing harmonic balance simulation is presented. The technique leverages circuit substructure to expose potential parallelism in the form of a di...
David L. Rhodes, Apostolos Gerasoulis
53
Voted
AAAI
2010
14 years 11 months ago
Fixing a Tournament
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u ca...
Virginia Vassilevska Williams
81
Voted
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
15 years 3 months ago
Probe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
70
Voted
SPDP
1990
IEEE
15 years 1 months ago
A semi distributed load balancing scheme for large multicomputer systems
In this paper, we propose a semi distributed approach, for load balancing in large parallel and distributedsystems. Theproposedschemeisa twolevel hierarchical scheme which partiti...
Ishfaq Ahmad, Arif Ghafoor
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 1 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig