258 search results - page 37 / 52 » New Lower Bounds for Heilbronn Numbers |
WADS
2007
Springer
14 years 1 months ago
2007
Springer
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
ASIACRYPT
2001
Springer
14 years 5 hour ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
ANCS
2005
ACM
14 years 1 months ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...