default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos A. A. Sanches
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Antonio C. P. Mesquita
, Carlos A. A. Sanches:
Air cargo load and route planning in pickup and delivery operations. Expert Syst. Appl. 249: 123711 (2024)- 2020
- [c2]Lucas Steuernagel, Marcos R. O. A. Máximo, Lucas A. Pereira, Carlos A. A. Sanches:
Convolutional Neural Network with Inception-like Module for Ball and Goalpost Detection in a Small Humanoid Soccer Robot. LARS/SBR/WRE 2020: 1-6
2010 – 2019
- 2019
- [j10]Vitor Venceslau Curtis, Carlos Alberto Alonso Sanches:
An improved balanced algorithm for the subset-sum problem. Eur. J. Oper. Res. 275(2): 460-466 (2019) - 2017
- [j9]Vitor Venceslau Curtis, Carlos Alberto Alonso Sanches:
A low-space algorithm for the subset-sum problem on GPU. Comput. Oper. Res. 83: 120-124 (2017) - 2016
- [j8]Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma:
A general resolution of intractable problems in polynomial time through DNA Computing. Biosyst. 150: 119-131 (2016) - [j7]Vitor Venceslau Curtis, Carlos Alberto Alonso Sanches:
An efficient solution to the subset-sum problem on GPU. Concurr. Comput. Pract. Exp. 28(1): 95-113 (2016) - 2014
- [j6]Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma:
A computational DNA solution approach for the Quadratic Diophantine Equation. Appl. Math. Comput. 238: 436-443 (2014) - 2010
- [j5]Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse:
Observations on optimal parallelizations of two-list algorithm. Parallel Comput. 36(1): 65-67 (2010)
2000 – 2009
- 2009
- [j4]Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma:
A polynomial-time DNA computing solution for the Bin-Packing Problem. Appl. Math. Comput. 215(6): 2055-2062 (2009) - 2008
- [j3]Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse:
Parallel time and space upper-bounds for the subset-sum problem. Theor. Comput. Sci. 407(1-3): 342-348 (2008) - 2007
- [j2]Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse:
An optimal and scalable parallelization of the two-list. Eur. J. Oper. Res. 176(2): 870-879 (2007) - 2003
- [b1]Carlos Alberto Alonso Sanches:
Algoritmos paralelos para o problema da mochila. Instituto Tecnológico de Aeronáutica, São José dos Campos, São Paulo, Brazil, 2003 - 2002
- [j1]Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse:
Comments on parallel algorithms for the knapsack problem. Parallel Comput. 28(10): 1501-1505 (2002)
1990 – 1999
- 1994
- [c1]Carlos Alberto Alonso Sanches, S. W. Song:
SIMD Algorithms for Matrix Multiplication on the Hypercube. IPPS 1994: 492-496
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-03 01:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
