Coalition Structure Generation with the Graphic Processor Unit
Coalition Structure Generation—the problem of finding the optimal set of coalitions— has received considerable attention in recent AI literature. The fastest exact algorithm to solve this problem is IDP-IP, due to Rahwan et al. (2012). This algorithm is a hybrid of two previous algorithms, namely ID...
Auteurs principaux: | Pawłowski, K, Kurach, K, Michalak, T, Rahwan, T |
---|---|
Format: | Report |
Publié: |
DCS
2013
|
Documents similaires
-
An Exact Algorithm for Coalition Structure Generation and Complete Set Partitioning
par: Rahwan, T, et autres
Publié: (2013) -
Anytime Coalition Structure Generation in Multi-Agent Systems With Positive or Negative Externalities
par: Talal Rahwan, et autres
Publié: (2011-12-01) -
Block-based neural network mapping on graphics processor unit /
par: Ong, Chin Tong, 1989-, author, et autres
Publié: (2015) -
Parallel Implementations of ARIA on ARM Processors and Graphics Processing Unit
par: Siwoo Eum, et autres
Publié: (2022-11-01) -
Efficient Pseudorandom number generators for biomolecular simulations on graphics processors
par: Artem Andreyevich Zhmurov, et autres
Publié: (2011-09-01)