Sciweavers

2323 search results - page 168 / 465
» Power optimization for connectivity problems
Sort
View
SBIA
2010
Springer
15 years 3 months ago
High-Level Modeling of Component-Based CSPs
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
Raphaël Chenouard, Laurent Granvilliers, Rica...
STACS
1999
Springer
15 years 9 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
SADM
2008
178views more  SADM 2008»
15 years 4 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
CDC
2010
IEEE
103views Control Systems» more  CDC 2010»
14 years 11 months ago
Energy conservation and interference mitigation: From decoupling property to win-win strategy
This paper studies the problem of energy conservation of mobile terminals in a multi-cell TDMA network supporting real-time sessions. The corresponding optimization problem involv...
Liqun Fu, Hongseok Kim, Jianwei Huang, Soung Chang...
COMPGEOM
2006
ACM
15 years 10 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...