2924 search results - page 461 / 585 » Lower Bounds in Distributed Computing |
157
Voted
ACSW
2006
15 years 6 months ago
2006
Service providers of the future could dynamically negotiate for, and create their infrastructure on Grid based utility computing and communication providers. Such commercialisatio...
157
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
138
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
143
click to vote
TAMC
2007
Springer
15 years 10 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
156
Voted
DAC
2008
ACM
2008
ACM
Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts
16 years 5 months ago
End-to-end latency of messages is an important design parameter that needs to be within specified bounds for the correct functioning of distributed real-time control systems. In t...