15485 search results - page 59 / 3097 » Computing Optimal Subsets |
FOCS
2008
IEEE
13 years 7 months ago
2008
IEEE
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...
COR
2008
13 years 7 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
IJRR
2010
13 years 5 months ago
2010
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
TCSV
2010
13 years 2 months ago
2010
A low complexity M-channel multiple description coding scheme is developed in this paper, in which each description carries one subset of the input with a higher bit rate and the r...
CODES
2006
IEEE
14 years 1 months ago
2006
IEEE
The use of Application Specific Instruction-set Processors (ASIP) is a solution to the problem of increasing complexity in embedded systems design. One of the major challenges in...