Sciweavers

1672 search results - page 300 / 335
» Tightness problems in the plane
Sort
View
ATAL
2006
Springer
14 years 14 days ago
The communication complexity of coalition formation among autonomous agents
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
13 years 10 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
IJCAI
2007
13 years 10 months ago
Web Page Clustering Using Heuristic Search in the Web Graph
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
Ron Bekkerman, Shlomo Zilberstein, James Allan
SIROCCO
2007
13 years 10 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
AAAI
1994
13 years 10 months ago
Exploiting Meta-Level information in a Distributed Scheduling System
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
Daniel E. Neiman, David W. Hildum, Victor R. Lesse...