243 search results - page 9 / 49 » On Balanced Graphs |
82
Voted
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
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...
53
Voted
AAAI
2010
14 years 11 months ago
2010
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...
81
Voted
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
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 ...
70
Voted
SPDP
1990
IEEE
15 years 1 months ago
1990
IEEE
In this paper, we propose a semi distributed approach, for load balancing in large parallel and distributedsystems. Theproposedschemeisa twolevel hierarchical scheme which partiti...
IFL
1997
Springer
15 years 1 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...