4009 search results - page 346 / 802 » Clustering on Complex Graphs |
164
click to vote
SIGECOM
2005
ACM
16 years 10 days ago
2005
ACM
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...
166
click to vote
WOWMOM
2005
ACM
16 years 10 days ago
2005
ACM
This paper presents a Self-Reorganizing Slot Allocation (SRSA) mechanism for TDMA based Medium Access Control (MAC) in multi-cluster sensor networks. The aim is to provide a MAC l...
165
click to vote
AAAI
2000
15 years 8 months ago
2000
If robotic agents are to act autonomously they must have the ability to construct and reason about models of their physical environment. For example, planning to achieve goals req...
175
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
180
click to vote
SIAMDM
2008
15 years 6 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...