2924 search results - page 445 / 585 » Lower Bounds in Distributed Computing |
155
click to vote
CLOUDCOM
2010
Springer
15 years 2 months ago
2010
Springer
Commercial cloud offerings, such as Amazon's EC2, let users allocate compute resources on demand, charging based on reserved time intervals. While this gives great flexibilit...
148
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
133
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
158
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
131
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...