34 search results - page 1 / 7 » The Cost of Monotonicity in Distributed Graph Searching |
OPODIS
2007
13 years 6 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...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
ENTCS
2007
13 years 4 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...