337 search results - page 44 / 68 » Semidefinite Programming Based Approximation Algorithms |
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
RTSS
2005
IEEE
14 years 1 months ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Spectrum sensing, which monitors the spectrum activity, is studied for cognitive radio systems using multiple frequency bands with non-negligible band switching time (blind per...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...