Research Grants 15/18164-5 - Algoritmos, Programação paralela - BV FAPESP
Advanced search
Start date
Betweenand

Parallel solutions to intractable problems in industrial processes

Abstract

The purpose of this aid is the acquisition of equipment for implementing and testing of parallel algorithms to intractable problems, which do not have polynomial-time resolutions on serial computers. The current focus is to find efficient algorithms to Knapsack Problem and Minimization of Open Stacks Problem, which are common in industrial processes, and their multicore and GPU implementations, devices with a high degree of parallel processing, affordable cost and low energy consumption. We also intend to acquire computers to prepare articles, attend conferences and conduct distance meetings. Guidelines are provided for students at various levels (Scientific Initiation, Completion of Course Work, Master and PhD), with the corresponding publications in indexed vehicles (conferences and journals). (AU)

Articles published in Agência FAPESP Newsletter about the research grant:
More itemsLess items
Articles published in other media outlets ( ):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Scientific publications
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
SANCHES, C. A. A.; SOMA, N. Y.. A general resolution of intractable problems in polynomial time through DNA Computing. BIOSYSTEMS, v. 150, p. 119-131, . (15/18164-5)
CURTIS, V. V.; SANCHES, C. A. A.. An improved balanced algorithm for the subset-sum problem. European Journal of Operational Research, v. 275, n. 2, p. 460-466, . (15/18164-5)
CURTIS, V. V.; SANCHES, C. A. A.. A low-space algorithm for the subset-sum problem on GPU. Computers & Operations Research, v. 83, p. 120-124, . (15/18164-5)

Please report errors in scientific publications list using this form.
X

Report errors in this page


Error details: