Detail publikace

Solving Multidimensional Knapsack Problem using CUDA Accelerated PSO

ZÁŇ, D. JAROŠ, J.

Originální název

Solving Multidimensional Knapsack Problem using CUDA Accelerated PSO

Anglický název

Solving Multidimensional Knapsack Problem using CUDA Accelerated PSO

Jazyk

en

Originální abstrakt

This paper addresses the possibility of solving the MKP using a GPU accelerated Particle Swarm Optimisation (PSO). The goal is to evaluate the attainable performance benefit when using a highly optimised GPU code instead of an efficient multi-core CPU implementation while preserving the quality of the search process.

Anglický abstrakt

This paper addresses the possibility of solving the MKP using a GPU accelerated Particle Swarm Optimisation (PSO). The goal is to evaluate the attainable performance benefit when using a highly optimised GPU code instead of an efficient multi-core CPU implementation while preserving the quality of the search process.

Dokumenty

BibTex 


@inproceedings{BUT111512,
  author="Drahoslav {Záň} and Jiří {Jaroš}",
  title="Solving Multidimensional Knapsack Problem using CUDA Accelerated PSO",
  annote="This paper addresses the possibility of solving the MKP using a GPU accelerated
Particle Swarm Optimisation (PSO). The goal is to evaluate the attainable
performance benefit when using a highly optimised GPU code instead of an
efficient multi-core CPU implementation while preserving the quality of the
search process.",
  address="IEEE Computational Intelligence Society",
  booktitle="2014 IEEE Congress on Evolutionary Computation",
  chapter="111512",
  edition="NEUVEDEN",
  howpublished="electronic, physical medium",
  institution="IEEE Computational Intelligence Society",
  year="2014",
  month="july",
  pages="2933--2939",
  publisher="IEEE Computational Intelligence Society",
  type="conference paper"
}