Severino F. Galán

Orcid: 0000-0003-3767-7480

Affiliations:
  • National University of Distance Education, Spain


According to our database1, Severino F. Galán authored at least 19 papers between 2001 and 2023.

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

2023
Self-adaptive polynomial mutation in NSGA-II.
Soft Comput., December, 2023

Minimum modulus visualization of algebraic fractals.
J. Comput. Lang., August, 2023

2021
Extending cellular evolutionary algorithms with message passing.
Soft Comput., 2021

Comparative Evaluation of the Fast Marching Method and the Fast Evacuation Method for Heterogeneous Media.
Appl. Artif. Intell., 2021

2019
Comparative evaluation of region query strategies for DBSCAN clustering.
Inf. Sci., 2019

2018
Neighborhood beautification: Graph layout through message passing.
J. Vis. Lang. Comput., 2018

2017
Simple decentralized graph coloring.
Comput. Optim. Appl., 2017

2014
Adaptive generalized crowding for genetic algorithms.
Inf. Sci., 2014

2013
A Novel Mating Approach for Genetic Algorithms.
Evol. Comput., 2013

2010
Generalized crowding for genetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009
Constraint Handling Using Tournament Selection: Abductive Inference in Partly Deterministic Bayesian Networks.
Evol. Comput., 2009

2008
Belief updating in Bayesian networks by using a criterion of minimum time.
Pattern Recognit. Lett., 2008

2007
Incorporating organizational factors into probabilistic safety assessment of nuclear power plants through canonical probabilistic models.
Reliab. Eng. Syst. Saf., 2007

Comparison of Two Types of Event Bayesian Networks: A Case Study.
Appl. Artif. Intell., 2007

2004
Comparative Evaluation of Temporal Nodes Bayesian Networks and Networks of Probabilistic Events in Discrete Time.
Proceedings of the MICAI 2004: Advances in Artificial Intelligence, 2004

2003
Efficient computation for the noisy MAX.
Int. J. Intell. Syst., 2003

2002
Networks of probabilistic events in discrete time.
Int. J. Approx. Reason., 2002

NasoNet, modeling the spread of nasopharyngeal cancer with networks of probabilistic events in discrete time.
Artif. Intell. Medicine, 2002

2001
NasoNet, Joining Bayesian Networks and Time to Model Nasopharyngeal Cancer Spread.
Proceedings of the Artificial Intelligence Medicine, 2001


  Loading...