default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFernando Lozano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c14]Carolina Higuera
, Fernando Lozano, Edgar Camilo Camacho, Carlos Hernando Higuera:
Multiagent Reinforcement Learning Applied to Traffic Light Signal Control. PAAMS 2019: 115-126- [c13]Carolina Higuera, Fernando Lozano, Edgar Camilo Camacho, Carlos Hernando Higuera:
Demonstration of Multiagent Reinforcement Learning Applied to Traffic Light Signal Control. PAAMS 2019: 255-258 - 2015
- [c12]Carlos A. Quintero, Reinaldo Uribe, Juan M. Calderón, Fernando Lozano:
Online Pairwise Ranking Based on Graph Edge-Connectivity. IBICA 2015: 499-509 - [i1]Reinaldo Uribe Muriel, Fernando Lozano, Charles Anderson:
Optimal Nudging: Solving Average-Reward Semi-Markov Decision Processes as a Minimal Sequence of Cumulative Tasks. CoRR abs/1504.05122 (2015) - 2013
- [c11]Carlos A. Quintero, Fernando Lozano:
Locally Linear Minimum Spanning Trees for Manifold Learning. ICMLA (1) 2013: 21-26 - [c10]Fernando Lozano:
Learning to Rank Drug Combinations. ICMLA (2) 2013: 436-440 - 2011
- [j2]Maria A. Zuluaga, Isabelle E. Magnin, Marcela Hernández Hoyos, Edgar J. F. Delgado Leyton, Fernando Lozano, Maciej Orkisz:
Automatic detection of abnormal vascular cross-sections based on density level detection and support vector machines. Int. J. Comput. Assist. Radiol. Surg. 6(2): 163-174 (2011) - [j1]Luis Felipe Giraldo, Fernando Lozano, Nicanor Quijano:
Foraging theory for dimensionality reduction of clustered data. Mach. Learn. 82(1): 71-90 (2011) - [c9]Reinaldo Uribe, Fernando Lozano, Katsunari Shibata, Charles Anderson:
Discount and speed/execution tradeoffs in Markov Decision Process games. CIG 2011: 79-86 - 2010
- [c8]Diego Ardila, José Abásolo, Fernando Lozano:
Multiple Kernel Learning for Ontology Instance Matching. KEOD 2010: 311-318
2000 – 2009
- 2007
- [c7]Elkin García, Fernando Lozano:
Boosting Support Vector Machines. MLDM Posters 2007: 153-167 - 2005
- [c6]Fernando Lozano, Vladimir Koltchinskii:
Self bounding genetic algorithms for machine learning. ICMLA 2005 - [c5]Fernando Lozano, Pedro Rangel:
Algorithms for parallel boosting. ICMLA 2005 - [c4]Pedro Rangel, Fernando Lozano, Elkin García:
Boosting of support vector machines with application to editing. ICMLA 2005 - 2001
- [c3]Vladimir Koltchinskii, Dmitriy Panchenko, Fernando Lozano:
Further Explanation of the Effectiveness of Voting Methods: The Game between Margins and Weights. COLT/EuroCOLT 2001: 241-255 - 2000
- [c2]Vladimir Koltchinskii, Dmitriy Panchenko, Fernando Lozano:
Some New Bounds on the Generalization Error of Combined Classifiers. NIPS 2000: 245-251
1990 – 1999
- 1997
- [c1]Don R. Hush, Fernando Lozano, Bill G. Horne:
Function Approximation with the Sweeping Hinge Algorithm. NIPS 1997: 535-541
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-25 05:41 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:
