110 search results - page 5 / 22 » A Faster Algorithm for Quasi-convex Integer Polynomial Optim... |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— Power consumption has become a crucial problem in modern circuit design. Multiple Supply Voltage (MSV) design is introduced to provide higher flexibility in controllin...
ISSAC
2005
Springer
15 years 3 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
IOR
2008
14 years 9 months ago
2008
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...