3475 search results - page 289 / 695 » Backbones in Optimization and Approximation |
200
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
157
click to vote
ISBI
2006
IEEE
16 years 7 months ago
2006
IEEE
Our goal is to optimize regularized image reconstruction methods for emission tomography with respect to the task of detecting small lesions of unknown location in the reconstruct...
217
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
149
click to vote
CPAIOR
2007
Springer
16 years 23 days ago
2007
Springer
One of the most important policies adopted in inventory control is the (R,S) policy (also known as the “replenishment cycle” policy). Under the non-stationary demand assumption...
186
click to vote
QOSIP
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...