Éric Monfroy
YOU?
Author Swipe
View article: Machine Learning and Metaheuristics Approach for Individual Credit Risk Assessment: A Systematic Literature Review
Machine Learning and Metaheuristics Approach for Individual Credit Risk Assessment: A Systematic Literature Review Open
Credit risk assessment plays a critical role in financial risk management, focusing on predicting borrower default to minimize losses and ensure compliance. This study systematically reviews 23 empirical articles published between 2019 and…
View article: Optimization of Convolutional Neural Networks With Multi-Objective Function Metaheuristics for Melanoma Detection
Optimization of Convolutional Neural Networks With Multi-Objective Function Metaheuristics for Melanoma Detection Open
Early and accurate detection of melanoma remains a critical challenge in medical imaging. Convolutional Neural Networks (CNNs) have demonstrated superior classification performance, often surpassing dermatologists in diagnostic accuracy. H…
View article: Classifying Words with 3-sort Automata
Classifying Words with 3-sort Automata Open
Grammatical inference consists in learning a language or a grammar from data. In this paper, we consider a number of models for inferring a non-deterministic finite automaton (NFA) with 3 sorts of states, that must accept some words, and r…
View article: Classifying Words with 3-sort Automata
Classifying Words with 3-sort Automata Open
Grammatical inference consists in learning a language or a grammar from data.In this paper, we consider a number of models for inferring a non-deterministic finite automaton (NFA) with 3 sorts of states, that must accept some words, and re…
View article: Taking advantage of a very simple property to efficiently infer NFAs
Taking advantage of a very simple property to efficiently infer NFAs Open
Grammatical inference consists in learning a formal grammar as a finite state machine or as a set of rewrite rules. In this paper, we are concerned with inferring Nondeterministic Finite Automata (NFA) that must accept some words, and reje…
View article: Taking Advantage of a Very Simple Property to Efficiently Infer NFAs
Taking Advantage of a Very Simple Property to Efficiently Infer NFAs Open
Grammatical inference consists in learning a formal grammar as a finite state machine or as a set of rewrite rules. In this paper, we are concerned with inferring Nondeterministic Finite Automata (NFA) that must accept some words, and reje…
View article: Optimized models and symmetry breaking for the NFA inference problem
Optimized models and symmetry breaking for the NFA inference problem Open
Grammatical inference is concerned with the study of algorithms for learning automata and grammars from words. We propose some models for learning Nondeterministic Finite Automaton (NFA) of size k from samples of words of the language and …
View article: GA and ILS for optimizing the size of NFA models
GA and ILS for optimizing the size of NFA models Open
Grammatical inference consists in learning a formal grammar (as a set of rewrite rules or a finite state machine). We are concerned with learning Nondeterministic Finite Automata (NFA) of a given size from samples of positive and negative …
View article: Analysis and Prediction of Engineering Student Behavior and Their Relation to Academic Performance Using Data Analytics Techniques
Analysis and Prediction of Engineering Student Behavior and Their Relation to Academic Performance Using Data Analytics Techniques Open
This study focuses on identifying personality traits in computer science students and determining whether they are related to academic performance. In addition, the importance of the personality traits based on motivation scale and depress…
View article: Modeling web services composition with constraints
Modeling web services composition with constraints Open
In this paper we consider the composition problem of Web services. Our framework is based on the existence of an abstract composition, i.e, the way some services of different types can be combined together in order to achieve a given task.…
View article: A Meta-Optimization Approach to Solve the Set Covering Problem
A Meta-Optimization Approach to Solve the Set Covering Problem Open
Context: In the industry the resources are increasingly scarce. For this reason, we must make a gooduse of it. Being the optimization tools, a good alternative that it is necessary to bear in mind. A realworldproblem is the facilities loca…
View article: Some Results on the design of Balanced Academic Curricula
Some Results on the design of Balanced Academic Curricula Open
In this paper, we present mathematical programming model for designing balanced academic curricula. The solution to this model gives a curriculum where the academic load of each period is as similar as possible. Based on the use of several…
View article: Reachability in Parametric Interval Markov Chains using Constraints
Reachability in Parametric Interval Markov Chains using Constraints Open
Parametric Interval Markov Chains (pIMCs) are a specification formalism that extend Markov Chains (MCs) and Interval Markov Chains (IMCs) by taking into account imprecision in the transition probability values: transitions in pIMCs are lab…
View article: Réduction et Encodage des Contraintes Ensemblistes en SAT
Réduction et Encodage des Contraintes Ensemblistes en SAT Open
D’un cˆot e, les probl`emes de satisfaction decontraintes (CSP) procurent une m ethode d eclarative etexpressive pour mod eliser les probl`emes. D’un autre cˆot e,les solveurs pour les probl`emes de satisfiabilit e …
View article: A Parallel-Oriented Language for Modeling Constraint-Based Solvers
A Parallel-Oriented Language for Modeling Constraint-Based Solvers Open
International audience
View article: Expressively Modeling the Social Golfer Problem in SAT
Expressively Modeling the Social Golfer Problem in SAT Open
Constraint Satisfaction Problems allow one to expressively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances. We thus present a technique to expressively model set constrain…
View article: Top-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math>Based Adaptive Enumeration in Constraint Programming
Top-Based Adaptive Enumeration in Constraint Programming Open
Constraint programming effectively solves constraint satisfaction and optimization problems by basically building, pruning, and exploring a search tree of potential solutions. In this context, a main component is the enumeration strategy, …