Solving intractable problems through natural computing

• Grant number: 06/05325-1
• Support Opportunities: Scholarships in Brazil - Post-Doctoral
• Start date: January 01, 2007
• End date: August 02, 2009
• Field of knowledge: Engineering - Aerospace Engineering
• Principal Investigator: Nei Yoshihiro Soma
• Grantee: Carlos Alberto Alonso Sanches
• Host Institution: Instituto Tecnológico de Aeronáutica (ITA). Ministério da Defesa (Brasil). São José dos Campos , SP, Brazil

Abstract

The objective of this project is to do research in Natural Computing topics for solving in efficient manner intractable problems, i.e. problems with no polytime bounded determination. In the Natural Computing, Biology provides tools for solving computational problems. (AU)

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)

ALONSO SANCHES, CARLOS ALBERTO; SOMA, NEI YOSHIHIRO. A polynomial-time DNA computing solution for the Bin-Packing Problem. Applied Mathematics and Computation, v. 215, n. 6, p. 2055-2062, NOV 15 2009. (06/05325-1)

ALONSO SANCHES, CARLOS ALBERTO; SOMA, NEI YOSHIHIRO; YANASSE, HORACIO HIDEKI. Observations on optimal parallelizations of two-list algorithm. PARALLEL COMPUTING, v. 36, n. 1, p. 65-67, JAN 2010. (06/05325-1)

SANCHES, C. A. A.; SOMA, N. Y.; YANASSE, H. H.. Parallel time and space upper-bounds for the subset-sum problem. THEORETICAL COMPUTER SCIENCE, v. 407, n. 1-3, p. 342-348, NOV 6 2008. (06/05325-1)