Sciweavers

1204 search results - page 183 / 241
» Termination of Polynomial Programs
Sort
View
AAIM
2008
Springer
94views Algorithms» more  AAIM 2008»
15 years 4 months ago
Speed Scaling with a Solar Cell
We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. We consider the speed scaling problem of scheduling a c...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
ICC
2007
IEEE
15 years 4 months ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz
COREGRID
2007
Springer
15 years 4 months ago
Optimal Closest Policy with Qos and Bandwidth Constraints
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
Veronika Rehn-Sonigo
CP
2007
Springer
15 years 4 months ago
Breaking Symmetry of Interchangeable Variables and Values
Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric soluti...
Yat Chiu Law, Jimmy Ho-Man Lee, Toby Walsh, J. Y. ...
HYBRID
2007
Springer
15 years 4 months ago
Approximation of the Joint Spectral Radius of a Set of Matrices Using Sum of Squares
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
Pablo A. Parrilo, Ali Jadbabaie