19866 search results - page 80 / 3974 » Computing all factorizations in *** |
149
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
146
click to vote
JGT
2008
15 years 6 months ago
2008
: A (g, f )-factor of a graph is a subset F of E such that for all v V, g(v) degF(v) f(v). Lovasz gave a necessary and sufficient condition for the existence of a (g, f )-factor...
175
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
156
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
In this note, the novel representation is proposed for a linear periodic continuous-time system with T-periodic real-valued coefficients. We prove that a T-periodic real-valued fac...