757 search results - page 12 / 152 » On the hardness of approximating Max-Satisfy |
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
89
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Recent works in modified compressed sensing (CS) show that reconstruction of sparse or compressible signals with partially known support yields better results than traditional CS...
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
Energy-efficiency and power-awareness for electronic systems have been important design issues in hardware and software implementations. We consider the scheduling of periodic ha...
PATMOS
2007
Springer
15 years 3 months ago
2007
Springer
This work deals with the problem to optimise the energy consumption of an embedded system. On system level, tasks are assumed to have a certain CPU-usage they need for completion. ...
111
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...