Parallelizing a new algorithm for the set partition problem
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:
PDFDOI: http://dx.doi.org/10.2478/v10065-010-0049-1
Date of publication: 2010-01-01 00:00:00
Date of submission: 2016-04-27 16:26:34
Statistics
Total abstract view - 568
Downloads (from 2020-06-17) - PDF - 0
Indicators
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Annales UMCS Sectio AI Informatica
This work is licensed under a Creative Commons Attribution 4.0 International License.