54 search results - page 7 / 11 » Approximability of Integer Programming with Generalised Cons... |
114
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
85
Voted
TCS
2010
14 years 8 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
IEEECIT
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we propose a new scheduling method for asynchronous circuits in bundled-data implementation. The method is based on integer linear programming (ILP) which explores ...
148
click to vote
DC
2011
13 years 9 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...