default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancisco Pérez-Galarce
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Francisco Pérez-Galarce
, Karim Pichara, Pablo Huijse, Márcio Catelán, Domingo Mery:
Informative regularization for a multi-layer perceptron RR Lyrae classifier under data shift. Astron. Comput. 43: 100694 (2023)- [j8]Fernando Montenegro-Dos Santos, Francisco Pérez-Galarce, Carlos Monardes-Concha, Alfredo Candia-Véjar, Marcelo Seido Nagano, Javier E. Gómez-Lagos:
A Rolling Horizon scheme for rescheduling in agricultural harvest. Comput. Electron. Agric. 215: 108392 (2023) - [j7]Jonathan Moya-Carvajal, Francisco Pérez-Galarce, Carla Taramasco, César A. Astudillo, Alfredo Candia-Véjar:
ML models for severity classification and length-of-stay forecasting in emergency units. Expert Syst. Appl. 223: 119864 (2023) - [i3]Francisco Pérez-Galarce, Karim Pichara, Pablo Huijse, Márcio Catelán, Domingo Mery:
Informative regularization for a multi-layer perceptron RR Lyrae classifier under data shift. CoRR abs/2303.06544 (2023) - [i2]Helem Salinas, Karim Pichara, Rafael Brahm, Francisco Pérez-Galarce, Domingo Mery:
Distinguishing a planetary transit from false positives: a Transformer-based classification for planetary transit signals. CoRR abs/2304.14283 (2023) - 2022
- [j6]Zureneth Govea, Francisco Pérez-Galarce, Alfredo Candia-Véjar:
An optimization model for the fair distribution of prize money in ATP tournaments. Int. J. Comput. Sci. Sport 21(1): 9-29 (2022) - 2021
- [j5]Francisco Pérez-Galarce, Alfredo Candia-Véjar, Guido Maculan, Nelson Maculan:
Improved robust shortest paths by penalized investments. RAIRO Oper. Res. 55(3): 1865-1883 (2021) - [i1]Francisco Pérez-Galarce, Karim Pichara, Pablo Huijse, Márcio Catelán, Domingo Mery:
Informative Bayesian model selection for RR Lyrae star classifiers. CoRR abs/2105.11531 (2021) - 2020
- [j4]David Revillot-Narváez, Francisco Pérez-Galarce, Eduardo Álvarez-Miranda:
Optimising the storage assignment and order-picking for the compact drive-in storage system. Int. J. Prod. Res. 58(22): 6949-6969 (2020)
2010 – 2019
- 2018
- [j3]Francisco Pérez-Galarce, Alfredo Candia-Véjar, César A. Astudillo, Matthew Bardeen:
Algorithms for the Minmax Regret Path problem with interval data. Inf. Sci. 462: 218-241 (2018) - 2017
- [j2]Celso Herrera-Cáceres, Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Alfredo Candia-Véjar:
Optimization of the harvest planning in the olive oil production: A case study in Chile. Comput. Electron. Agric. 141: 147-159 (2017) - 2014
- [j1]Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Paolo Toth:
On exact solutions for the Minmax Regret Spanning Tree problem. Comput. Oper. Res. 47: 114-122 (2014) - [c1]Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Emilio Carrizosa, Francisco Pérez-Galarce:
Vulnerability Assessment of Spatial Networks: Models and Solutions. ISCO 2014: 433-444
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-10-07 21:15 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:
