Artigos em periódicos com seletiva política
editorial:
- Air cargo load and route planning in pickup and
delivery operations, A.C.P. Mesquita and C.A.A.
Sanches, Expert Systems with Applications, Vol.
249, Part B, 1237111, 2024 [doi].
- An improved balanced
algorithm for the subset-sum problem, V.V. Curtis
and C.A.A. Sanches, European
Journal of Operational Research, Vol. 275(2), pp.
460-466, 2019 [doi] .
- A low-space algorithm
for the subset-sum problem on GPU, V.V.
Curtis and C.A.A. Sanches, Computers & Operations Research, Vol.
83, pp. 120-124, 2017 [doi].
- A general resolution
of intractable problems in polynomial time through
DNA Computing, C.A.A. Sanches and N.Y.
Soma, BioSystems, Vol.
150, pp. 119-131, 2016 [doi]
- An efficient solution
to the subset-sum problem on GPU, V.V.
Curtis and C.A.A. Sanches, Concurrency
and Computation: Practice and Experience, Vol.
28(1), pp. 95-113, 2016 [doi]
- A computational DNA
solution approach for the quadratic diophantine equation,
C.A.A. Sanches and N.Y. Soma, Applied Mathematics and Computation, Vol.
238, pp. 436-443, 2014 [doi]
- Observations on
optimal parallelizations of two-list algorithm,
C.A.A. Sanches, N.Y. Soma and H.H. Yanasse, Parallel Computing,
Vol. 36(1), pp. 65-67, 2010 [doi]
- A polynomial-time DNA
computing solution for the bin-packing problem,
C.A.A. Sanches and N.Y. Soma, Applied
Mathematics and Computation, Vol. 215(6), pp.
2055-2062, 2009 [doi]
- Parallel time and
space upper-bounds for the subset-sum problem,
C.A.A. Sanches, N.Y. Soma and H.H. Yanasse, Theoretical Computer Science,
Vol. 407(1-3), pp. 342-348, 2008 [doi]
- An optimal and
scalable parallelization of the two-list algorithm for
the subset-sum problem, C.A.A. Sanches, N.Y. Soma
and H.H. Yanasse, European
Journal of Operational Research, Vol. 176(2), pp.
870-879, 2007 [doi]
- Comments on parallel
algorithms for the knapsack problem, C.A.A.
Sanches, N.Y. Soma and H.H. Yanasse, Parallel Computing,
Vol. 28(10), pp. 1501-1505, 2002 [doi]
Participações em congressos internacionais:
- Convolutional neural network with inception-like
module for ball and goalpost detection in a small
humanoid soccer robot, L. Steuernagel, M.R.O.A.
Maximo, L.A. Pereira and C.A.A. Sanches, Proceedings
of Latin American Robotics Symposium, Brazilian
Symposium on Robotics and Workshop on Robotics in
Education (LARS-SBR-WRE 2020, virtual). November
9-12, 2020 – Natal, Brazil [doi]
- Polynomial-time DNA
computing solution for bin-packing problem,
C.A.A. Sanches and N.Y. Soma, The
Annual Conference of the UK Operational Research Society
(OR 50). September 9-11, 2008 – York, England
- An adaptive optimal
parallel two-list algorithm for the knapsack problem,
C.A.A. Sanches, N.Y. Soma and H.H. Yanasse, The European Operational
Research Conference (EURO 2001). July 9-11, 2001
– Rotterdam, The Netherlands
- SIMD algorithms for
matrix multiplication on the hypercube, C.A.
Alonso Sanches and S. W. Song, Proceedings
of Eighth International Parallel Processing Symposium
(IPPS 94). IEEE Computer Society Technical
Commitee on Parallel Processing. April 26-29, 1994 –
Cancún, Mexico [doi]
Tese de doutorado:
Algoritmos paralelos para o
problema da mochila [
zip]
Orientadores: Dr. Nei Y. Soma e Dr. Horácio H. Yanasse
IEC-ITA (2003)
Dissertação de mestrado:
Novos
algoritmos SIMD para multiplicação de matrizes no
hipercubo [pdf]
Orientador: Dr. Siang W. Song
IME-USP (1992)