Carlos A. A. Sanches

Orcid: 0000-0002-8048-7204

According to our database1, Carlos A. A. Sanches authored at least 13 papers between 1994 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Convolutional Neural Network with Inception-like Module for Ball and Goalpost Detection in a Small Humanoid Soccer Robot.
Proceedings of the Latin American Robotics Symposium, 2020

2019
An improved balanced algorithm for the subset-sum problem.
Eur. J. Oper. Res., 2019

2017
A low-space algorithm for the subset-sum problem on GPU.
Comput. Oper. Res., 2017

2016
An efficient solution to the <i>subset-sum problem</i> on GPU.
Concurr. Comput. Pract. Exp., 2016

A general resolution of intractable problems in polynomial time through DNA Computing.
Biosyst., 2016

2014
A computational DNA solution approach for the Quadratic Diophantine Equation.
Appl. Math. Comput., 2014

2010
Observations on optimal parallelizations of two-list algorithm.
Parallel Comput., 2010

2009
A polynomial-time DNA computing solution for the Bin-Packing Problem.
Appl. Math. Comput., 2009

2008
Parallel time and space upper-bounds for the subset-sum problem.
Theor. Comput. Sci., 2008

2007
An optimal and scalable parallelization of the two-list.
Eur. J. Oper. Res., 2007

2003
Algoritmos paralelos para o problema da mochila.
PhD thesis, 2003

2002
Comments on parallel algorithms for the knapsack problem.
Parallel Comput., 2002

1994
SIMD Algorithms for Matrix Multiplication on the Hypercube.
Proceedings of the 8th International Symposium on Parallel Processing, 1994


  Loading...