835 search results - page 14 / 167 » Finding Optimal Solutions to Cooperative Pathfinding Problem... |
GECCO
2004
Springer
14 years 3 days ago
2004
Springer
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
CEC
2010
IEEE
13 years 7 months ago
2010
IEEE
— Many evolutionary algorithms have been proposed for large scale optimization. Parameter interaction in nonseparable problems is a major source of performance loss specially on ...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—Channel assignment is a very important topic in wireless networks. In this paper, we study FDMA channel assignment in a non-cooperative wireless network, where devices are sel...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
—For a wireless network with ¢ nodes distributed in an area £ , with ¢ source-destination pairs communicating with each other at some common rate, the hierarchical cooperation...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then a...