686 search results - page 133 / 138 » Packing Cycles in Graphs |
IEEESCC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
75
Voted
CORR
2010
Springer
14 years 6 months ago
2010
Springer
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
102
click to vote
CPC
2010
14 years 6 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
118
click to vote
PRDC
2009
IEEE
15 years 4 months ago
2009
IEEE
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
CGO
2006
IEEE
15 years 3 months ago
2006
IEEE
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...