986 search results - page 64 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
124
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
122
click to vote
DATE
2000
IEEE
15 years 7 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
120
Voted
INFORMS
2000
15 years 3 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
150
Voted
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
140
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...