543 search results - page 14 / 109 » A Multiagent Algorithm for Graph Partitioning |
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
UAI
2004
13 years 9 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
GECCO
2009
Springer
13 years 5 months ago
2009
Springer
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...
AI
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...