default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCaio C. O. Ramos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j6]Silas Evandro Nachif Fernandes
, Danillo Roberto Pereira, Caio C. O. Ramos, André N. de Souza, Danilo S. Gastaldello, João P. Papa:
A Probabilistic Optimum-Path Forest Classifier for Non-Technical Losses Detection. IEEE Trans. Smart Grid 10(3): 3226-3235 (2019)- 2018
- [j5]Caio C. O. Ramos, Douglas Rodrigues, André N. de Souza, João Paulo Papa:
On the Study of Commercial Losses in Brazil: A Binary Black Hole Algorithm for Theft Characterization. IEEE Trans. Smart Grid 9(2): 676-683 (2018) - 2016
- [j4]Danillo Roberto Pereira, Mario A. Pazoti, Luís A. M. Pereira, Douglas Rodrigues, Caio C. O. Ramos, André N. de Souza, João P. Papa:
Social-Spider Optimization-based Support Vector Machines applied for energy theft detection. Comput. Electr. Eng. 49: 25-38 (2016) - [j3]Bruno Albuquerque de Castro, Guilherme Clerice, Caio C. O. Ramos, André Luiz Andreoli, Fabricio Baptista, Fernando de Souza Campos, José Alfredo Covolan Ulson:
Partial Discharge Monitoring in Power Transformers Using Low-Cost Piezoelectric Sensors. Sensors 16(8): 1266 (2016) - [i1]Silas Evandro Nachif Fernandes, Danillo Roberto Pereira, Caio C. O. Ramos, André N. de Souza, João Paulo Papa:
A Probabilistic Optimum-Path Forest Classifier for Binary Classification Problems. CoRR abs/1609.00878 (2016) - 2015
- [c4]Douglas Rodrigues, Caio Cesar Oba Ramos, André Nunes de Souza, João Paulo Papa:
Black Hole Algorithm for non-technical losses characterization. LASCAS 2015: 1-4 - 2013
- [c3]Douglas Rodrigues, Luís A. M. Pereira, João P. Papa, Caio C. O. Ramos, André N. de Souza, Luciene P. Papa:
Optimizing Feature Selection through Binary Charged System Search. CAIP (1) 2013: 377-384 - [c2]Douglas Rodrigues, Luís A. M. Pereira, T. N. S. Almeida, João Paulo Papa, André N. de Souza, Caio C. O. Ramos, Xin-She Yang:
BCS: A Binary Cuckoo Search algorithm for feature selection. ISCAS 2013: 465-468 - 2012
- [j2]André N. de Souza, Pedro da Costa Jr., Paulo S. da Silva, Caio C. O. Ramos, João P. Papa:
Efficient Fault Location in Underground Distribution Systems through Optimum-Path Forest. Appl. Artif. Intell. 26(5): 503-515 (2012) - 2011
- [j1]Caio C. O. Ramos, André N. de Souza, Giovani Chiachia, Alexandre X. Falcão, João P. Papa:
A novel algorithm for feature selection using Harmony Search and its application for non-technical losses detection. Comput. Electr. Eng. 37(6): 886-894 (2011) - [c1]Caio C. O. Ramos, João Paulo Papa, André N. de Souza, Giovani Chiachia, Alexandre X. Falcão:
What is the importance of selecting features for non-technical losses identification? ISCAS 2011: 1045-1048
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-04-24 22:49 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:
