835 search results - page 14 / 167 » Finding Optimal Solutions to Cooperative Pathfinding Problem... |
121
click to vote
GECCO
2004
Springer
15 years 9 months 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 ...
140
click to vote
CEC
2010
IEEE
15 years 4 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 ...
135
click to vote
INFOCOM
2008
IEEE
15 years 10 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...
131
click to vote
ICC
2008
IEEE
15 years 10 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...
142
click to vote
GECCO
2009
Springer
15 years 8 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...