default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVinicius F. Carida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Paulo Finardi, Leonardo Avila, Rodrigo Castaldoni, Pedro Gengo, Celio Larcher, Marcos Piau, Pablo B. Costa, Vinicius Fernandes Caridá:
The Chronicles of RAG: The Retriever, the Chunk and the Generator. CoRR abs/2401.07883 (2024)- 2023
- [i5]Celio Larcher, Marcos Piau, Paulo Finardi, Pedro Gengo, Piero Esposito, Vinicius F. Carida:
Cabrita: closing the gap for foreign languages. CoRR abs/2308.11878 (2023) - [i4]Paulo Finardi, Wanderley M. Melo, Edgard D. Medeiros Neto, Alex F. Mansano, Pablo B. Costa, Vinicius Fernandes Caridá:
Portuguese FAQ for Financial Services. CoRR abs/2311.11331 (2023) - 2021
- [i3]Paulo Finardi, José Dié Viegas, Gustavo T. Ferreira, Alex F. Mansano, Vinicius Fernandes Caridá:
BERTaú: Itaú BERT for digital customer service. CoRR abs/2101.12015 (2021) - 2020
- [i2]Amir Jalilifard, Vinicius Fernandes Caridá, Alex Mansano, Rogers Cristo:
Semantic Sensitive TF-IDF to Determine Word Relevance in Documents. CoRR abs/2001.09896 (2020)
2010 – 2019
- 2019
- [c7]Vinicius Fernandes Caridá, Amir Jalilifard, Alex Mansano, Rogers Cristo:
Can NetGAN be Improved on Short Random Walks? BRACIS 2019: 663-668 - [i1]Amir Jalilifard, Vinicius Fernandes Caridá, Alex Mansano, Rogers Cristo:
Can NetGAN be improved by short random walks originated from dense vertices? CoRR abs/1905.05298 (2019) - 2016
- [b1]Vinicius Fernandes Caridá:
Modelo fuzzy cascata multiatributos e preditivo para despacho de AGVs em FMS. Federal University of São Carlos, Brazil, 2016 - [c6]Carlos C. M. Tuma, Orides Morandin, Vinicius F. Carida:
Comparison of performance the neighborhood operators and the ratio of search local-global in minimizing makespan using an GA-VNS collaboration to solve reactive production scheduling. IECON 2016: 66-71 - 2014
- [c5]Vinicius F. Carida, Orides Morandin, Paulo R. Cerioni, Carlos C. M. Tuma:
Prediction Model Using Coverability Tree from a Modeling in Petri Nets Applied in AGVs Dispatching. BRACIS 2014: 140-145 - 2013
- [c4]Carlos C. M. Tuma, Orides Morandin, Vinicius F. Carida:
Minimizing the makespan for the problem of reactive production scheduling in a FMS with AGVs using a new structure of chromosome in a hybrid GA with TS. ETFA 2013: 1-6 - [c3]Felipe Bezerra Reis, Vinicius F. Carida, Orides Morandin, Renan L. Castro, Carlos C. M. Tuma:
A collaborative fuzzy CPN system for conflict solution of flexible manufacturing system. IECON 2013: 3216-3221 - [c2]Orides Morandin, Carlos C. M. Tuma, Vinicius F. Carida, Emerson Carlos Pedrino, Roberto H. Tsunaki
:
PSO in 2D-space to solve reactive scheduling problems in FMS to reduce the makespan. ISIE 2013: 1-6 - 2011
- [c1]Orides Morandin Jr., Vinicius Fernandes Caridá, Edilson Reis Rodrigues Kato, Marcos Abraão de Souza Fonseca:
A hierarchical fuzzy rule-based building model applied to a AGV dispatching system in an FMS. ICRA 2011: 3764-3769
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 23:07 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:
