Frédéric Lardeux
YOU?
Author Swipe
View article: An Efficient Probabilistic Population-Based Descent for the Median Genome Problem
An Efficient Probabilistic Population-Based Descent for the Median Genome Problem Open
We present a novel population-based local search algorithm for the {\\em median genome problem}. The primary result of this article is that this probabilistic approach significantly improves the performance of ancestral genome reconstructi…
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: An Overview of Data Extraction From Invoices
An Overview of Data Extraction From Invoices Open
This paper provides a comprehensive overview of the process for information retrieval from invoices. Invoices serve as proof of purchase and contain important information, including the date, description, quantity, and the price of goods o…
View article: A Two-stage Approach for Tables Extraction in Invoices
A Two-stage Approach for Tables Extraction in Invoices Open
International audience
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: A two-stage approach for table extraction in invoices
A two-stage approach for table extraction in invoices Open
The automated analysis of administrative documents is an important field in document recognition that is studied for decades. Invoices are key documents among these huge amounts of documents available in companies and public services. Invo…
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: On the Attainability of NK Landscapes Global Optima
On the Attainability of NK Landscapes Global Optima Open
In this paper, we aim at evaluating the impact of the starting point of a basic local search based on the first improvement strategy. We define the coverage rate of a configuration as the proportion of the search space from which a particu…
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: Abacus: A New Hybrid Encoding for SAT Problems
Abacus: A New Hybrid Encoding for SAT Problems Open
Encoding an instance of a Constraint Satisfaction Problem (CSP) into a Propositional Satisfiability Problem (SAT) instance is usually a good way to benefit from the highly efficient SAT solvers. However, an encoding may not be suitable for…
View article: A Sequence-Based Metaheuristics for Tactical Distribution Problems in Closed-Loop Supply Chains
A Sequence-Based Metaheuristics for Tactical Distribution Problems in Closed-Loop Supply Chains Open
International audience
View article: Accelerated Algorithm for Computation of All Prime Patterns in Logical Analysis of Data
Accelerated Algorithm for Computation of All Prime Patterns in Logical Analysis of Data Open
The analysis of groups of binary data can be achieved by logical based approaches. These approaches identify subsets of relevant Boolean variables to characterize observations and may help the user to better understand their properties. In…
View article: A Sequence-Based Metaheuristic For Tactical Distribution Planning In Closed-Loop Supply Chains
A Sequence-Based Metaheuristic For Tactical Distribution Planning In Closed-Loop Supply Chains Open
We present a metaheuristic for planning the distribution of items in closed-loop supply chains. This metaheuristic composes sequences of transfer and repair actions to generate plans iteratively. It uses a local search algorithm based on a…
View article: Dynamic Multi-Armed Bandit Algorithm for the Cyclic Bandwidth Sum Problem
Dynamic Multi-Armed Bandit Algorithm for the Cyclic Bandwidth Sum Problem Open
Memetic algorithms (MAs) are a powerful resource when dealing with optimization problems, combining the diversification of the population-based approaches with the intensification of local search. However, their success depends on the comb…
View article: Alternative evaluation functions for the cyclic bandwidth sum problem
Alternative evaluation functions for the cyclic bandwidth sum problem Open
International audience
View article: A combinatorial optimisation approach for closed-loop supply chain inventory planning with deterministic demand
A combinatorial optimisation approach for closed-loop supply chain inventory planning with deterministic demand Open
International audience
View article: Model and Combinatorial Optimization Methods for Tactical Planning in Closed-Loop Supply Chains
Model and Combinatorial Optimization Methods for Tactical Planning in Closed-Loop Supply Chains Open
International audience
View article: Empirical Analysis of Operators for Permutation Based Problems
Empirical Analysis of Operators for Permutation Based Problems Open
This paper presents an analysis of different possible oper-ators for local search algorithms in order to solve permutation-based problems. These operators can be defined by a distance metric that de-fine the neighborhood of the current con…
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 …