835 search results - page 63 / 167 » Finding Optimal Solutions to Cooperative Pathfinding Problem... |
135
click to vote
AAAI
2000
15 years 5 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
151
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
145
click to vote
HEURISTICS
2006
15 years 4 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
180
click to vote
ICML
1995
IEEE
16 years 5 months ago
1995
IEEE
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
165
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...