Jose Divasón
Orcid: 0000-0002-5173-128X
According to our database1,
Jose Divasón
authored at least 40 papers
between 2013 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
HYB-PARSIMONY: A hybrid approach combining Particle Swarm Optimization and Genetic Algorithms to find parsimonious models in high-dimensional datasets.
Neurocomputing, December, 2023
Artificial Intelligence Models for Assessing the Evaluation Process of Complex Student Projects.
IEEE Trans. Learn. Technol., October, 2023
PSO-PARSIMONY: A method for finding parsimonious and accurate machine learning models with particle swarm optimization. Application for predicting force-displacement curves in T-stub steel connections.
Neurocomputing, 2023
Sensitivity analysis of discrete preference functions using Koszul simplicial complexes.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023
Proceedings of the Hybrid Artificial Intelligent Systems - 18th International Conference, 2023
Proceedings of the Hybrid Artificial Intelligent Systems - 18th International Conference, 2023
Robustness Analysis of a Methodology to Detect Biases, Inconsistencies and Discrepancies in the Evaluation Process.
Proceedings of the International Joint Conference 16th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2023) 14th International Conference on EUropean Transnational Education (ICEUTE 2023), 2023
2022
J. Autom. Reason., 2022
J. Autom. Reason., 2022
New Hybrid Methodology Based on Particle Swarm Optimization with Genetic Algorithms to Improve the Search of Parsimonious Models in High-Dimensional Databases.
Proceedings of the Hybrid Artificial Intelligent Systems - 17th International Conference, 2022
2021
Computing invariants for multipersistence via spectral systems and effective homology.
J. Symb. Comput., 2021
Two algorithms based on modular arithmetic: lattice basis reduction and Hermite normal form computation.
Arch. Formal Proofs, 2021
2020
Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL.
J. Autom. Reason., 2020
J. Autom. Reason., 2020
Arch. Formal Proofs, 2020
2019
ACM Commun. Comput. Algebra, 2019
Proceedings of the Formal Methods Teaching - Third International Workshop and Tutorial, 2019
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019
2018
A verified factorization algorithm for integer polynomials with polynomial complexity.
Arch. Formal Proofs, 2018
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018
Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018
Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper).
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018
Proceedings of the Artificial Intelligence and Symbolic Computation, 2018
2017
A Formalisation in HOL of the Fundamental Theorem of Linear Algebra and Its Application to the Solution of the Least Squares Problem.
J. Autom. Reason., 2017
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017
2016
Formal Aspects Comput., 2016
2015
Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm.
J. Funct. Program., 2015
Proceedings of the NASA Formal Methods - 7th International Symposium, 2015
2014
Proceedings of the Artificial Intelligence and Symbolic Computation, 2014
2013
Proceedings of the Logic-Based Program Synthesis and Transformation, 2013