22 search results - page 5 / 5 » Competitive algorithms and lower bounds for online randomize... |
FCT
2009
Springer
13 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...
STACS
2005
Springer
13 years 10 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...