543 search results - page 80 / 109 » A Multiagent Algorithm for Graph Partitioning |
97
Voted
TC
1998
15 years 6 days ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
121
Voted
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
121
click to vote
NIPS
2008
15 years 2 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
103
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Ranking systems are a fundamental ingredient of multi-agent environments and Internet Technologies. These settings can be viewed as social choice settings with two distinguished p...
81
Voted
TCS
2008
15 years 14 days ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...