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...
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 ...
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 ...
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...
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...