Jean-Paul Delahaye

Orcid: 0000-0002-8758-9908

Affiliations:
  • Université de Lille


According to our database1, Jean-Paul Delahaye authored at least 52 papers between 1985 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Softening and Hardening in the Iterated Prisoner's Dilemma.
IEEE Trans. Syst. Man Cybern. Syst., 2023

Être ou ne pas être individualiste, quelles conséquences ?
Revue Ouverte d'Intelligence Artificielle (ROIA), 2023

2021
Coopération généralisée et attracteurs au dilemme itéré du prisonnier.
Proceedings of the Collectifs cyber-physiques, 2021

2019
Experimental criteria to identify efficient probabilistic memory-one strategies for the iterated prisoner's dilemma.
Simul. Model. Pract. Theory, 2019

2018
Stratégies probabilistes à mémoire de 1 coup au dilemme itéré du prisonnier.
Rev. d'Intelligence Artif., 2018

An Algorithmic Look at Financial Volatility.
Algorithms, 2018

2017
Human behavioral complexity peaks at age 25.
PLoS Comput. Biol., 2017

New Winning Strategies for the Iterated Prisoner's Dilemma.
J. Artif. Soc. Soc. Simul., 2017

Que valent les stratégies probabilistes au dilemme itéré des prisonniers ?
Proceedings of the Cohésion : fondement ou propriété émergente - JFSMA 17, 2017

2016
Organized Complexity: is Big History a Big Computation?
CoRR, 2016

Méta-Stratégies pour le Dilemme Itéré du Prisonnier.
Proceedings of the Systèmes Multi-Agents et simulation, 2016

2015
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility.
PeerJ Comput. Sci., 2015

Estimating the algorithmic complexity of stock markets.
Algorithmic Finance, 2015

2013
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures.
Comput., 2013

2012
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
CoRR, 2012

Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
CoRR, 2012

Image characterization and classification by physical complexity.
Complex., 2012

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness.
Appl. Math. Comput., 2012

2011
Unpredictability and Computational Irreducibility
CoRR, 2011

Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas
CoRR, 2011

Assessing Cognitive Randomness: A Kolmogorov Complexity Approach
CoRR, 2011

2010
An algorithmic information-theoretic approach to the behaviour of financial markets
CoRR, 2010

Image information content characterization and classification by physical complexity
CoRR, 2010

2009
A CounterExample to Kahle-Conjecture, New Conjectures and Automated Proofs in Geometry
CoRR, 2009

On the Algorithmic Nature of the World
CoRR, 2009

2008
Towards a stable definition of Kolmogorov-Chaitin complexity
CoRR, 2008

2007
On the Kolmogorov-Chaitin Complexity for short sequences
CoRR, 2007

2000
The Iterated Lift Dilemma.
Proceedings of the Computational Conflicts, 2000

1999
Transformation distances: a family of dissimilarity measures based on movements of segments.
Bioinform., 1999

Studies on Dynamics in the Classical Iterated Prisoner's Dilemma with Few Strategies.
Proceedings of the Artificial Evolution, 4th European Conference, 1999

1998
Optimal Representation in Average Using Kolmogorov Complexity.
Theor. Comput. Sci., 1998

The transformation distance: A dissimilarity measure based an movements of segments.
Proceedings of the German Conference on Bioinformatics, 1998

Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma.
Proceedings of the Evolutionary Programming VII, 7th International Conference, 1998

1997
Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences.
Comput. Appl. Biosci., 1997

1996
A Guaranteed Compression Scheme for Repetitive DNA Sequences.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1994
A Kind of Logical Compilation for Knowledge Bases.
Theor. Comput. Sci., 1994

A Kind of Achievement by Parts Method.
Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994

1993
An achievement by part method to solve the incompleteness of forward chaining.
Proceedings of the 2èmes Journées Francophones de Programmation Logique (JFPL 93), 1993

1992
The grand loop semantics for logic programs.
Proceedings of the JFPL'92, 1992

1991
Is there an Axiomatic Semantics for Standard Pure Prolog.
Theor. Comput. Sci., 1991

Programming in Three-valued Logic.
Theor. Comput. Sci., 1991

Unfolding, Procedural and Fixpoint Semantics of Logic Programs.
Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991

1990
A new model semantics for a program with negation.
Proceedings of the SPLT'90, 1990

Operational semantics of Standard Prolog: an axiomatic approach.
Proceedings of the SPLT'90, 1990

The Logical Compilation of Knowledge Bases.
Proceedings of the Logics in AI, European Workshop, 1990

The Optimal Model of a Program with Negation.
Proceedings of the Logics in AI, European Workshop, 1990

1989
Logique Partielle et Prolog.
Proceedings of the SPLT'89, 1989

1988
Sémantique Logique Et Dénotationnelle Des Interpréteurs Prolog.
RAIRO Theor. Informatics Appl., 1988

Stratégie générale d'exploration et coupe-choix.
Proceedings of the SPLT'88, 1988

1987
Différences entre la sémantique déclarative et la sémantique procédurale d'un programme Prolog avec coupe-choix.
Proceedings of the SPLT'87, 1987

1986
Définitions de stratégies équitables en programmation logique.
Proceedings of the SPLT'86, 1986

1985
Sur Quelques Limitations des Algorithmes Dans Le Traitement des Suites.
RAIRO Theor. Informatics Appl., 1985


  Loading...