740 search results - page 128 / 148 » Lower bounds for Buchsbaum* complexes |
149
click to vote
IPPS
2007
IEEE
16 years 13 days ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
161
click to vote
CSL
2007
Springer
16 years 9 days ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
182
click to vote
ICPADS
2006
IEEE
16 years 5 days ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
149
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
173
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...