Sciweavers

1301 search results - page 113 / 261
» Bounded Version Vectors
Sort
View
105
Voted
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
15 years 25 days ago
Bin Packing with Rejection Revisited
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...
Leah Epstein
89
Voted
CSL
2010
Springer
15 years 24 days ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
92
Voted
JCT
2006
89views more  JCT 2006»
15 years 20 days ago
Revlex-initial 0/1-polytopes
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial sets of 0/1-vectors. Thus for each n 2d , we consider the 0/1-knapsack polytope ...
Rafael Gillmann, Volker Kaibel
141
Voted
TSMC
2002
107views more  TSMC 2002»
15 years 10 days ago
Guaranteed robust nonlinear estimation with application to robot localization
When reliable prior bounds on the acceptable errors between the data and corresponding model outputs are available, bounded-error estimation techniques make it possible to characte...
Luc Jaulin, Michel Kieffer, Eric Walter, Dominique...
120
Voted
CORR
2011
Springer
207views Education» more  CORR 2011»
14 years 4 months ago
Ergodic Transmission Capacity of Wireless Ad Hoc Networks with Interference Management
Most work on wireless network throughput ignores the temporal correlation inherent to wireless channels because it degrades tractability. To better model and quantify the temporal...
Chun-Hung Liu, Jeffrey G. Andrews