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...
Main Authors: | Pawłowski, K, Kurach, K, Michalak, T, Rahwan, T |
---|---|
Formato: | Report |
Publicado em: |
DCS
2013
|
Registos relacionados
-
An Exact Algorithm for Coalition Structure Generation and Complete Set Partitioning
Por: Rahwan, T, et al.
Publicado em: (2013) -
Anytime Coalition Structure Generation in Multi-Agent Systems With Positive or Negative Externalities
Por: Talal Rahwan, et al.
Publicado em: (2011-12-01) -
Block-based neural network mapping on graphics processor unit /
Por: Ong, Chin Tong, 1989-, author, et al.
Publicado em: (2015) -
Parallel Implementations of ARIA on ARM Processors and Graphics Processing Unit
Por: Siwoo Eum, et al.
Publicado em: (2022-11-01) -
Efficient Pseudorandom number generators for biomolecular simulations on graphics processors
Por: Artem Andreyevich Zhmurov, et al.
Publicado em: (2011-09-01)