2924 search results - page 128 / 585 » Lower Bounds in Distributed Computing |
106
Voted
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
111
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
75
Voted
HPCC
2005
Springer
15 years 6 months ago
2005
Springer
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
104
click to vote
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
104
Voted
TECS
2010
14 years 11 months ago
2010
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...