Parallelizing a new algorithm for the set partition problem

Hoang Chi Thanh

Abstract


In this paper we propose a new approach to organizing parallel computing to find a sequence of all solutions to a problem. We split the sequence into subsequences and then execute concurrently the processes to find these subsequences. We propose a new simple algorithm for the set partition problem and apply the above technique for this algorithm.

Full Text:

PDF


DOI: http://dx.doi.org/10.17951/ai.2010.10.2.21-28
Data publikacji: 2010-01-01 00:00:00
Data złożenia artykułu: 2016-04-27 16:26:34

Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Annales UMCS Sectio AI Informatica

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.