Jean-Paul Delahaye

61 papers A 2B 4Journal 35Unranked 18
YearRankTypeTitle / Venue / Authors
2024 — conf
Avons nous toujours besoin de stochasticité pour la simulation évolutionnaire ?
JFSMA
Philippe Mathieu, Jean-Paul Delahaye
2023 J jnl
Softening and Hardening in the Iterated Prisoner's Dilemma.
IEEE Trans. Syst. Man Cybern. Syst.
Philippe Mathieu, Jean-Paul Delahaye
2023 J jnl
Être ou ne pas être individualiste, quelles conséquences ?
Rev. Ouverte Intell. Artif.
Jean-Paul Delahaye, Philippe Mathieu
2021 — conf
Coopération généralisée et attracteurs au dilemme itéré du prisonnier.
JFSMA
Jean-Paul Delahaye, Philippe Mathieu
2019 J jnl
Experimental criteria to identify efficient probabilistic memory-one strategies for the iterated prisoner's dilemma.
Simul. Model. Pract. Theory
Philippe Mathieu, Jean-Paul Delahaye
2018 J jnl
An Algorithmic Look at Financial Volatility.
Algorithms
Lin Ma, Jean-Paul Delahaye
2018 J jnl
Stratégies probabilistes à mémoire de 1 coup au dilemme itéré du prisonnier.
Rev. d'Intelligence Artif.
Jean-Paul Delahaye, Philippe Mathieu
2017 J jnl
Human behavioral complexity peaks at age 25.
PLoS Comput. Biol.
Nicolas Gauvrit, Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Peter C. Brugger
2017 J jnl
New Winning Strategies for the Iterated Prisoner's Dilemma.
J. Artif. Soc. Soc. Simul.
Philippe Mathieu, Jean-Paul Delahaye
2017 — conf
Que valent les stratégies probabilistes au dilemme itéré des prisonniers ?
JFSMA
Jean-Paul Delahaye, Philippe Mathieu
2016 — conf
Méta-Stratégies pour le Dilemme Itéré du Prisonnier.
JFSMA
Jean-Paul Delahaye, Philippe Mathieu
2016 J jnl
Organized Complexity: is Big History a Big Computation?
CoRR
Jean-Paul Delahaye, Clement Vidal
2015 J jnl
Estimating the algorithmic complexity of stock markets.
Algorithmic Finance
Olivier Brandouy, Jean-Paul Delahaye, Lin Ma
2015 A conf
New Winning Strategies for the Iterated Prisoner's Dilemma.
AAMAS
Philippe Mathieu, Jean-Paul Delahaye
2015 J jnl
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility.
PeerJ Comput. Sci.
Héctor Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit
2013 J jnl
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures.
Comput.
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit
2012 J jnl
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
CoRR
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit
2012 J jnl
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
CoRR
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit
2012 J jnl
Image characterization and classification by physical complexity.
Complex.
Hector Zenil, Jean-Paul Delahaye, Cédric Gaucherel
2012 J jnl
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness.
Appl. Math. Comput.
Jean-Paul Delahaye, Hector Zenil
2012 J jnl
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
CoRR
Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit
2011 J jnl
Assessing Cognitive Randomness: A Kolmogorov Complexity Approach
CoRR
Nicolas Gauvrit, Hector Zenil, Jean-Paul Delahaye
2011 J jnl
Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness
CoRR
Jean-Paul Delahaye, Hector Zenil
2011 J jnl
Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas
CoRR
Hector Zenil, Jean-Paul Delahaye
2011 J jnl
Unpredictability and Computational Irreducibility
CoRR
Hervé Zwirn, Jean-Paul Delahaye
2010 J jnl
An algorithmic information-theoretic approach to the behaviour of financial markets
CoRR
Hector Zenil, Jean-Paul Delahaye
2010 J jnl
Image information content characterization and classification by physical complexity
CoRR
Hector Zenil, Jean-Paul Delahaye, Cédric Gaucherel
2009 J jnl
A CounterExample to Kahle-Conjecture, New Conjectures and Automated Proofs in Geometry
CoRR
Francesco De Comité, Jean-Paul Delahaye
2009 J jnl
On the Algorithmic Nature of the World
CoRR
Hector Zenil, Jean-Paul Delahaye
2008 J jnl
Networks of Communities and Evolution of Cooperation.
Int. J. Bifurc. Chaos
Rémi Dorat, Jean-Paul Delahaye
2008 J jnl
Towards a stable definition of Kolmogorov-Chaitin complexity
CoRR
Jean-Paul Delahaye, Hector Zenil
2007 J jnl
On the Kolmogorov-Chaitin Complexity for short sequences
CoRR
Jean-Paul Delahaye, Héctor Zenil
2000 — conf
A Stamping Technique to Increase the Error Correction Capacity of the (127, k, d) RS Code.
IOLTW
T. Vallino, Abbas Dandache, Jean-Paul Delahaye, Fabrice Monteiro, Bernard Lepley
2000 — ch.
The Iterated Lift Dilemma.
Computational Conflicts
Jean-Paul Delahaye, Philippe Mathieu, Bruno Beaufils
1999 — conf
Studies on Dynamics in the Classical Iterated Prisoner's Dilemma with Few Strategies.
Artificial Evolution
Philippe Mathieu, Bruno Beaufils, Jean-Paul Delahaye
1999 J jnl
Transformation distances: a family of dissimilarity measures based on movements of segments.
Bioinform.
Jean-Stéphane Varré, Jean-Paul Delahaye, Eric Rivals
1998 — conf
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma.
Evolutionary Programming
Bruno Beaufils, Jean-Paul Delahaye, Philippe Mathieu
1998 J jnl
Optimal Representation in Average Using Kolmogorov Complexity.
Theor. Comput. Sci.
Eric Rivals, Jean-Paul Delahaye
1998 — conf
The transformation distance: A dissimilarity measure based an movements of segments.
German Conference on Bioinformatics
Jean-Stéphane Varré, Jean-Paul Delahaye, Eric Rivals
1997 J jnl
Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences.
Comput. Appl. Biosci.
Eric Rivals, Olivier Delgrange, Jean-Paul Delahaye, Max Dauchet, Marie-Odile Delorme, Alain Hénaut, Emmanuelle Ollivier
1996 B conf
A Guaranteed Compression Scheme for Repetitive DNA Sequences.
Data Compression Conference
Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange
1994 B conf
A Kind of Achievement by Parts Method.
LPAR
Philippe Mathieu, Jean-Paul Delahaye
1994 J jnl
A Kind of Logical Compilation for Knowledge Bases.
Theor. Comput. Sci.
Philippe Mathieu, Jean-Paul Delahaye
1993 — conf
An achievement by part method to solve the incompleteness of forward chaining.
JFPL
Jean-Paul Delahaye, Philippe Mathieu
1992 — ed.
JFPL'92, 1
JFPL
Jean-Paul Delahaye, Philippe Devienne, Philippe Mathieu, Pascal Yim
1992 — conf
The grand loop semantics for logic programs.
CNKBS
Eric Wegrzynowski, Jean-Paul Delahaye
1992 — conf
The grand loop semantics for logic programs.
JFPL
Eric Wegrzynowski, Jean-Paul Delahaye
1991 J jnl
Is there an Axiomatic Semantics for Standard Pure Prolog.
Theor. Comput. Sci.
François Denis, Jean-Paul Delahaye
1991 J jnl
Programming in Three-valued Logic.
Theor. Comput. Sci.
Jean-Paul Delahaye, V. Thibau
1991 — conf
Unfolding, Procedural and Fixpoint Semantics of Logic Programs.
JTASPEFT/WSA
François Denis, Jean-Paul Delahaye
1991 A conf
Unfolding, Procedural and Fixpoint Semantics of Logic Programs.
STACS
François Denis, Jean-Paul Delahaye
1990 — conf
A new model semantics for a program with negation.
SPLT
Jean-Paul Delahaye, V. Thibau
1990 — conf
Operational semantics of Standard Prolog: an axiomatic approach.
SPLT
Jean-Paul Delahaye, François Denis
1990 B conf
The Logical Compilation of Knowledge Bases.
JELIA
Philippe Mathieu, Jean-Paul Delahaye
1990 B conf
The Optimal Model of a Program with Negation.
JELIA
Jean-Paul Delahaye, V. Thibau
1989 — conf
Logique Partielle et Prolog.
SPLT
Jean-Paul Delahaye, Philippe Mathieu
1988 — conf
Stratégie générale d'exploration et coupe-choix.
SPLT
Jean-Paul Delahaye
1988 J jnl
Sémantique Logique Et Dénotationnelle Des Interpréteurs Prolog.
RAIRO Theor. Informatics Appl.
Jean-Paul Delahaye
1987 — conf
Différences entre la sémantique déclarative et la sémantique procédurale d'un programme Prolog avec coupe-choix.
SPLT
Jean-Paul Delahaye
1986 — conf
Définitions de stratégies équitables en programmation logique.
SPLT
Jean-Paul Delahaye, P. Paradinas
1985 J jnl
Sur Quelques Limitations des Algorithmes Dans Le Traitement des Suites.
RAIRO Theor. Informatics Appl.
Jean-Paul Delahaye