Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...
We describe a framework for automatically selecting a summary set of photos from a large collection of geo-referenced photographs. Such large collections are inherently difficult ...
Alexander Jaffe, Mor Naaman, Tamir Tassa, Marc Dav...
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...