Abstract. This paper presents the performance evaluation of five memory allocation strategies for the PerDiS Persistent Distributed Object store in the context of allocating two di...
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...