646 search results - page 35 / 130 » Generalized efficiency bounds in distributed resource alloca... |
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
120
click to vote
PDCN
2004
15 years 1 months ago
2004
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
100
click to vote
MANSCI
2007
14 years 11 months ago
2007
In this paper, a market-based decomposition method for decomposable linear systems is developed. The solution process iterates between a master problem that solves the market-matc...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...