91 search results - page 7 / 19 » A dynamic inequality generation scheme for polynomial progra... |
SPLC
2004
14 years 11 months ago
2004
Abstract. This paper considers the use of a state-of-the-art, generalpurpose, component programming language, specifically ArchJava, to implement software product lines. Component ...
ECRTS
2005
IEEE
15 years 3 months ago
2005
IEEE
Branch prediction mechanisms are becoming commonplace within current generation processors. Dynamic branch predictors, albeit able to predict branches quite accurately in average,...
JCO
2011
14 years 4 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
84
Voted
DAM
2007
14 years 9 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...