258 search results - page 18 / 52 » New Lower Bounds for Heilbronn Numbers |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The earliest-deadline-first (EDF) scheduling of a sporadic real-time task system on a multiprocessor may require that the total utilization of the task system, Usum, not exceed (...
SPAA
1994
ACM
13 years 11 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
ESCAPE
2007
Springer
14 years 1 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
COMBINATORICS
2004
13 years 7 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...