406 search results - page 73 / 82 » Gadgets, Approximation, and Linear Programming |
VLSI
2010
Springer
14 years 7 months ago
2010
Springer
—Multi-Vdd techniques enable application of lower supply voltage levels on cells with timing slacks. New voltage assignment, placement and voltage island partitioning methods are...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
84
Voted
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...
NIPS
2008
14 years 11 months ago
2008
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
STRINGOLOGY
2004
14 years 10 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...