3875 search results - page 425 / 775 » Approximation algorithms for the 0-extension problem |
149
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...
201
click to vote
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...
178
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...
172
click to vote
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...
192
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...