2924 search results - page 175 / 585 » Lower Bounds in Distributed Computing |
99
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
142
Voted
NETWORKING
2010
15 years 4 months ago
2010
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
125
Voted
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
127
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
92
Voted
DCC
2010
IEEE
15 years 2 months ago
2010
IEEE
We derive lower and upper bounds for the size of a hyperoval of a finite polar space of rank r {2, 3}. We give a computer-free proof for the uniqueness, up to isomorphism, of the...