José E. Gallardo

Orcid: 0000-0002-0646-2535

According to our database1, José E. Gallardo authored at least 21 papers between 1994 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Evolutionary Algorithms for Optimizing Emergency Exit Placement in Indoor Environments.
Proceedings of the Applications of Evolutionary Computation - 27th European Conference, 2024

2019
New perspectives on the optimal placement of detectors for suicide bombers using metaheuristics.
Nat. Comput., 2019

2018
Metaheuristic approaches to the placement of suicide bomber detectors.
J. Heuristics, 2018

2015
A GRASP-based memetic algorithm with path relinking for the far from most string problem.
Eng. Appl. Artif. Intell., 2015

2012
Memetic Algorithms and Complete Techniques.
Proceedings of the Handbook of Memetic Algorithms, 2012

2009
Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms.
J. Artif. Intell. Res., 2009

Finding low autocorrelation binary sequences with memetic algorithms.
Appl. Soft Comput., 2009

2008
Hybridizations of Metaheuristics With Branch & Bound Derivates.
Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008

Finding Still Lifes with Memetic/Exact Hybrid Algorithms
CoRR, 2008

2007
On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques.
IEEE Trans. Syst. Man Cybern. Part B, 2007

A memetic algorithm for the low autocorrelation binary sequence problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2007

Reconstructing Phylogenies with Memetic Algorithms and Branch-and-Bound.
Proceedings of the Analysis of Biological Data: A Soft Computing Approach, 2007

2006
A Multi-level Memetic/Exact Hybrid Algorithm for the Still Life Problem.
Proceedings of the Parallel Problem Solving from Nature, 2006

A Memetic Algorithm with Bucket Elimination for the Still Life Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

2005
Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound.
Proceedings of the Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, 2005

A hybrid model of evolutionary algorithms and branch-and-bound for combinatorial optimization problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

1997
Inheritance and Selective Methods Dispatching in Concurrent Haskell.
Proceedings of the Programming Languages: Implementations, 1997

1996
Clasificacion de Objetos Funcionales en Entornos Concurrentes.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995
Monadas para la Comunicacion de Objetos Funcionales.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995

1994
Monadas y Procesos Funcionales Comunicantes.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994


  Loading...