761 search results - page 32 / 153 » Efficient Approximation Algorithms for the Subset-Sums Equal... |
151
click to vote
ECCC
2000
15 years 5 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
173
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
157
click to vote
ICPR
2008
IEEE
16 years 10 days ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
162
click to vote
CCE
2004
15 years 5 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
159
click to vote
AAAI
1997
15 years 7 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...