4432 search results - page 380 / 887 » Solving Demodulation as an Optimization Problem |
151
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
157
click to vote
DAGSTUHL
1994
15 years 6 months ago
1994
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
126
click to vote
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
144
click to vote
ESORICS
2010
Springer
15 years 5 months ago
2010
Springer
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
135
click to vote
TCS
2008
15 years 4 months ago
2008
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...