686 search results - page 99 / 138 » Packing Cycles in Graphs |
132
Voted
IEEEPACT
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
145
click to vote
SIAMDM
2008
15 years 3 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
138
click to vote
MSCS
2007
15 years 2 months ago
2007
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
153
Voted
NOMS
2010
IEEE
15 years 1 months ago
2010
IEEE
The trend for future mobile networks is to move away from Network Elements (NEs) delivered with specially tailored configurations towards off-the-shelf products. The configurations...
127
Voted
ISBRA
2007
Springer
15 years 9 months ago
2007
Springer
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The state-of-theart approach is to perform clustering and then...