Sciweavers

543 search results - page 9 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
AGENTS
1999
Springer
14 years 6 days ago
Team-Partitioned, Opaque-Transition Reinforcement Learning
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-transition reinforcement learning (TPOT-RL). TPOT-RL introduces the concept of usin...
Peter Stone, Manuela M. Veloso
ICML
2010
IEEE
13 years 9 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
AE
2003
Springer
14 years 1 months ago
Optimising Graph Partitions Using Parallel Evolution
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
Raul Baños, Consolación Gil, Julio O...
STOC
2006
ACM
77views Algorithms» more  STOC 2006»
14 years 8 months ago
Graph partitioning using single commodity flows
Rohit Khandekar, Satish Rao, Umesh V. Vazirani
WAW
2007
Springer
159views Algorithms» more  WAW 2007»
14 years 2 months ago
Local Partitioning for Directed Graphs Using PageRank
Reid Andersen, Fan R. K. Chung, Kevin J. Lang