543 search results - page 55 / 109 » A Multiagent Algorithm for Graph Partitioning |
130
click to vote
JETAI
2008
15 years 4 months ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
150
click to vote
LCTRTS
2010
Springer
15 years 11 months ago
2010
Springer
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
113
Voted
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
166
click to vote
MLMTA
2007
15 years 5 months ago
2007
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
163
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...