453 search results - page 29 / 91 » Tight bounds for the partial-sums problem |
DATE
1998
IEEE
14 years 22 days ago
1998
IEEE
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
DBISP2P
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p sys...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
TIT
2011
13 years 3 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in th...