337 search results - page 44 / 68 » Semidefinite Programming Based Approximation Algorithms |
142
click to vote
ASPDAC
2007
ACM
15 years 8 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...
145
click to vote
PODS
2004
ACM
16 years 4 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 ...
140
click to vote
RTSS
2005
IEEE
15 years 10 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...
144
click to vote
ICC
2009
IEEE
15 years 11 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...
119
click to vote
ISSAC
2007
Springer
15 years 10 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 ...