Jean-Paul Delahaye
Orcid: 0000-0002-8758-9908Affiliations:
- Université de Lille
According to our database1,
Jean-Paul Delahaye
authored at least 54 papers
between 1985 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2023
IEEE Trans. Syst. Man Cybern. Syst., 2023
Rev. Ouverte Intell. Artif., 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
Rev. d'Intelligence Artif., 2018
2017
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
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
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
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness.
Appl. Math. Comput., 2012
2011
CoRR, 2011
2010
CoRR, 2010
CoRR, 2010
2009
A CounterExample to Kahle-Conjecture, New Conjectures and Automated Proofs in Geometry
CoRR, 2009
2008
2007
2000
A Stamping Technique to Increase the Error Correction Capacity of the (127, k, d) RS Code.
Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW 2000), 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
Theor. Comput. Sci., 1998
The transformation distance: A dissimilarity measure based an movements of segments.
Proceedings of the German Conference on Bioinformatics, 1998
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
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996
1994
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 CNKBS'92, 1992
1991
Proceedings of the STACS 91, 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
Proceedings of the Logics in AI, European Workshop, 1990
Proceedings of the Logics in AI, European Workshop, 1990
1989
Logique Partielle et Prolog.
Proceedings of the SPLT'89, 1989
1988
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
RAIRO Theor. Informatics Appl., 1985