2924 search results - page 131 / 585 » Lower Bounds in Distributed Computing |
108
Voted
MFCS
2010
Springer
14 years 10 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
295
click to vote
ICDCSW
2008
IEEE
15 years 7 months ago
2008
IEEE
We present an early vision of a cyber-physical environment in which computer controlled rendering of physical surfaces, terrains, and environments is achieved by manipulating grid...
110
Voted
PODC
1997
ACM
15 years 4 months ago
1997
ACM
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...
87
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
99
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...