11 citations · 12 across the 8 of their papers we have counts for
9 papers
Position Spaces and Graphs
Rita-Nathalia Assaf, Tom Davot, Frédéric Lardeux +1
In this paper, we introduce position graphs, a graph-based reasoning framework based on the formalization of position spaces. This framework utilizes two strict partial orders, rep…
Taking advantage of a very simple property to efficiently infer NFAs
Tomasz Jastrzab, Frédéric Lardeux, Eric Monfroy
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…
A two-stage approach for table extraction in invoices
Thomas Saout, Frédéric Lardeux, Frédéric Saubion
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…
A Computational Model for Logical Analysis of Data
Danièle Gardy, Frédéric Lardeux, Frédéric Saubion
Initially introduced by Peter Hammer, Logical Analysis of Data is a methodology that aims at computing a logical justification for dividing a group of data in two groups of observa…
Improved SAT models for NFA learning
Frédéric Lardeux, Eric Monfroy
Grammatical inference is concerned with the study of algorithms for learning automata and grammars from words. We focus on learning Nondeterministic Finite Automaton of size k from…
GA and ILS for optimizing the size of NFA models
Frédéric Lardeux, Eric Monfroy
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 (…
An Experimental Study of Adaptive Control for Evolutionary Algorithms
Giacomo di Tollo, Frédéric Lardeux, Jorge Maturana +1
The balance of exploration versus exploitation (EvE) is a key issue on evolutionary computation. In this paper we will investigate how an adaptive controller aimed to perform Opera…
Simulating Non Stationary Operators in Search Algorithms
Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion
In this paper, we propose a model for simulating search operators whose behaviour often changes continuously during the search. In these scenarios, the performance of the operators…
Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem
Frédéric Lardeux, Eric Monfroy, Broderick Crawford +1
On the one hand, Constraint Satisfaction Problems allow one to declaratively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge S…