default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé E. Gallardo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Carlos Cotta
, José E. Gallardo:
Evolutionary Algorithms for Optimizing Emergency Exit Placement in Indoor Environments. EvoApplications@EvoStar 2024: 194-208- [i6]Carlos Cotta, José E. Gallardo:
Evolutionary Algorithms for Optimizing Emergency Exit Placement in Indoor Environments. CoRR abs/2405.18352 (2024) - [i5]Carlos Cotta, José E. Gallardo:
Metaheuristic approaches to the placement of suicide bomber detectors. CoRR abs/2405.18593 (2024) - [i4]Carlos Cotta, José E. Gallardo:
New perspectives on the optimal placement of detectors for suicide bombers using metaheuristics. CoRR abs/2405.19060 (2024) - [i3]José E. Gallardo, Carlos Cotta:
A GRASP-based memetic algorithm with path relinking for the far from most string problem. CoRR abs/2406.07567 (2024)
2010 – 2019
- 2019
- [j6]Carlos Cotta, José E. Gallardo:
New perspectives on the optimal placement of detectors for suicide bombers using metaheuristics. Nat. Comput. 18(2): 249-263 (2019) - 2018
- [j5]Carlos Cotta, José E. Gallardo:
Metaheuristic approaches to the placement of suicide bomber detectors. J. Heuristics 24(3): 483-513 (2018) - 2015
- [j4]José E. Gallardo, Carlos Cotta:
A GRASP-based memetic algorithm with path relinking for the far from most string problem. Eng. Appl. Artif. Intell. 41: 183-194 (2015) - 2014
- [i2]José Enrique Gallardo, Carlos Cotta, Antonio J. Fernández:
Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms. CoRR abs/1401.3477 (2014) - 2012
- [p3]Carlos Cotta, Antonio José Fernández Leiva, José E. Gallardo:
Memetic Algorithms and Complete Techniques. Handbook of Memetic Algorithms 2012: 189-200
2000 – 2009
- 2009
- [j3]José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
Finding low autocorrelation binary sequences with memetic algorithms. Appl. Soft Comput. 9(4): 1252-1262 (2009) - [j2]José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms. J. Artif. Intell. Res. 35: 533-555 (2009) - 2008
- [p2]Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Monaldo Mastrolilli:
Hybridizations of Metaheuristics With Branch & Bound Derivates. Hybrid Metaheuristics 2008: 85-116 - [e1]Maria J. Blesa, Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, 5th International Workshop, HM 2008, Málaga, Spain, October 8-9, 2008. Proceedings. Lecture Notes in Computer Science 5296, Springer 2008, ISBN 978-3-540-88438-5 [contents] - [i1]José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
Finding Still Lifes with Memetic/Exact Hybrid Algorithms. CoRR abs/0812.4170 (2008) - 2007
- [j1]José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques. IEEE Trans. Syst. Man Cybern. Part B 37(1): 77-83 (2007) - [c10]Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo:
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem. EvoCOP 2007: 36-47 - [c9]José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
A memetic algorithm for the low autocorrelation binary sequence problem. GECCO 2007: 1226-1233 - [p1]José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
Reconstructing Phylogenies with Memetic Algorithms and Branch-and-Bound. Analysis of Biological Data: A Soft Computing Approach 2007: 59-84 - 2006
- [c8]José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
A Memetic Algorithm with Bucket Elimination for the Still Life Problem. EvoCOP 2006: 73-85 - [c7]José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
A Multi-level Memetic/Exact Hybrid Algorithm for the Still Life Problem. PPSN 2006: 212-221 - 2005
- [c6]José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
A hybrid model of evolutionary algorithms and branch-and-bound for combinatorial optimization problems. Congress on Evolutionary Computation 2005: 2248-2254 - [c5]José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound. IWINAC (2) 2005: 21-30
1990 – 1999
- 1997
- [c4]José E. Gallardo, Francisco Gutiérrez, Blas C. Ruiz:
Inheritance and Selective Methods Dispatching in Concurrent Haskell. PLILP 1997: 33-46 - 1996
- [c3]Blas C. Ruiz, José E. Gallardo, Pablo Guerrero, Francisco Gutiérrez:
Clasificacion de Objetos Funcionales en Entornos Concurrentes. APPIA-GULP-PRODE 1996: 581-584 - 1995
- [c2]José E. Gallardo, Pablo Guerrero, Blas C. Ruiz:
Monadas para la Comunicacion de Objetos Funcionales. GULP-PRODE 1995: 471-476 - 1994
- [c1]José E. Gallardo, Pablo Guerrero, Blas C. Ruiz:
Monadas y Procesos Funcionales Comunicantes. GULP-PRODE (1) 1994: 266-280
Coauthor Index
aka: Antonio José Fernández Leiva
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-08-07 22:30 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:
