169 search results - page 2 / 34 » Decentralized Search with Random Costs |
98
Voted
OPODIS
2007
15 years 3 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
137
Voted
ISCC
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
105
click to vote
DAIS
2006
15 years 3 months ago
2006
Abstract. As the amount of information available to users continues to grow, filtering wanted items from unwanted ones becomes a dominant task. To this end, various collaborative-f...
108
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
136
Voted
JSAC
2007
15 years 1 months ago
2007
Abstract— The current approach in web searching, i.e., centralized search engines, rises issues that question their future applicability: 1) coverage and scalability, 2) freshnes...