3874 search results - page 392 / 775 » Approximation Algorithms for k-hurdle Problems |
195
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
147
click to vote
ICCD
2003
IEEE
16 years 3 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
199
Voted
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
177
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
171
Voted
IJON
2007
15 years 6 months ago
2007
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...