| Efficient computation for the noisy MAX FJ Díez, SF Galán International Journal of Intelligent Systems 18 (2), 165-177, 2003 | 121* | 2003 |
| NasoNet, modeling the spread of nasopharyngeal cancer with networks of probabilistic events in discrete time SF Galan, F Aguado, FJ Dıez, J Mira Artificial Intelligence in Medicine 25 (3), 247-264, 2002 | 55 | 2002 |
| Modeling dynamic causal interaction with Bayesian networks: temporal noisy gates SF Galán, FJ Díez Proc. 2nd Inter. Workshop on Causal Networks, 1-5, 2000 | 43 | 2000 |
| Networks of probabilistic events in discrete time SF Galán, FJ Díez International Journal of Approximate Reasoning 30 (3), 181-202, 2002 | 42 | 2002 |
| Incorporating organizational factors into probabilistic safety assessment of nuclear power plants through canonical probabilistic models SF Galán, A Mosleh, JM Izquierdo Reliability Engineering & System Safety 92 (8), 1131-1138, 2007 | 40 | 2007 |
| Generalized crowding for genetic algorithms SF Galan, OJ Mengshoel Proceedings of the 12th annual conference on Genetic and evolutionary …, 2010 | 30 | 2010 |
| Comparison of two types of event Bayesian networks: A case study SF Galán, G Arroyo-Figueroa, FJ Díez, LE Sucar Applied Artificial Intelligence 21 (3), 185-209, 2007 | 25 | 2007 |
| A novel mating approach for genetic algorithms SF Galán, OJ Mengshoel, R Pinter Evolutionary computation 21 (2), 197-229, 2013 | 24 | 2013 |
| Adaptive generalized crowding for genetic algorithms OJ Mengshoel, SF Galán, A De Dios Information Sciences 258, 140-159, 2014 | 22 | 2014 |
| Problemas resueltos de inteligencia artificial aplicada: búsqueda y representación SF Galán, JG Boticario, JMM Mira Pearson Educación, 2005 | 18 | 2005 |
| NasoNet, joining Bayesian networks, and time to model nasopharyngeal cancer spread SF Galán, F Aguado, FJ Díez, J Mira Conference on Artificial Intelligence in Medicine in Europe, 207-216, 2001 | 18 | 2001 |
| Comparative evaluation of region query strategies for DBSCAN clustering SF Galán Information Sciences 502, 76-90, 2019 | 16 | 2019 |
| Constraint handling using tournament selection: Abductive inference in partly deterministic Bayesian networks SF Galán, OJ Mengshoel Evolutionary Computation 17 (1), 55-88, 2009 | 10 | 2009 |
| Simple decentralized graph coloring SF Galán Computational Optimization and Applications 66 (1), 163-185, 2017 | 7 | 2017 |
| Neighborhood beautification: Graph layout through message passing SF Galán, OJ Mengshoel Journal of Visual Languages & Computing 44, 72-88, 2018 | 4 | 2018 |
| Belief updating in Bayesian networks by using a criterion of minimum time SF Galán Pattern recognition letters 29 (4), 465-482, 2008 | 3 | 2008 |
| Fast Evacuation Method: Using an effective dynamic floor field based on efficient pedestrian assignment SF Galán Safety Science 120, 79-88, 2019 | 2 | 2019 |
| Comparative evaluation of temporal nodes Bayesian networks and networks of probabilistic events in discrete time SF Galán, G Arroyo-Figueroa, FJ Díez, LE Sucar Mexican International Conference on Artificial Intelligence, 498-507, 2004 | 2 | 2004 |
| Extending cellular evolutionary algorithms with message passing SF Galán Soft Computing 25 (8), 6271-6282, 2021 | | 2021 |
| Message Passing Cellular Automata SF Galán Marcombo, 2020 | | 2020 |
Francisco Javier DíezProfessor of Artificial Intelligence, Universidad Nacional de Educación a Distancia (UNED)Verified email at dia.uned.es
