Jean-Paul Delahaye

Proceedings of the Simulation multi-agents : nouvelles approches, nouveaux enjeux, 2024

2023

Softening and Hardening in the Iterated Prisoner's Dilemma.

[BibT_eX]

[DOI]

IEEE Trans. Syst. Man Cybern. Syst., 2023

Être ou ne pas être individualiste, quelles conséquences ?

[BibT_eX]

[DOI]

Rev. Ouverte Intell. Artif., 2023

2021

Coopération généralisée et attracteurs au dilemme itéré du prisonnier.

[BibT_eX]

Proceedings of the Collectifs cyber-physiques, 2021

2019

Experimental criteria to identify efficient probabilistic memory-one strategies for the iterated prisoner's dilemma.

[BibT_eX]

[DOI]

Simul. Model. Pract. Theory, 2019

2018

Stratégies probabilistes à mémoire de 1 coup au dilemme itéré du prisonnier.

[BibT_eX]

[DOI]

Rev. d'Intelligence Artif., 2018

An Algorithmic Look at Financial Volatility.

[BibT_eX]

[DOI]

Lin Ma

Algorithms, 2018

2017

Human behavioral complexity peaks at age 25.

[BibT_eX]

[DOI]

Peter C. Brugger

PLoS Comput. Biol., 2017

New Winning Strategies for the Iterated Prisoner's Dilemma.

[BibT_eX]

[DOI]

J. Artif. Soc. Soc. Simul., 2017

Que valent les stratégies probabilistes au dilemme itéré des prisonniers ?

[BibT_eX]

Proceedings of the Cohésion : fondement ou propriété émergente - JFSMA 17, 2017

2016

Organized Complexity: is Big History a Big Computation?

[BibT_eX]

[DOI]

Clement Vidal

CoRR, 2016

Méta-Stratégies pour le Dilemme Itéré du Prisonnier.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Héctor Zenil

PeerJ Comput. Sci., 2015

Estimating the algorithmic complexity of stock markets.

[BibT_eX]

[DOI]

Olivier Brandouy

Lin Ma

Algorithmic Finance, 2015

2013

Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures.

[BibT_eX]

[DOI]

Comput., 2013

2012

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

[BibT_eX]

[DOI]

CoRR, 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

Image characterization and classification by physical complexity.

[BibT_eX]

[DOI]

Cédric Gaucherel

Complex., 2012

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2012

2011

Unpredictability and Computational Irreducibility

[BibT_eX]

[DOI]

Hervé Zwirn

CoRR, 2011

Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas

[BibT_eX]

[DOI]

CoRR, 2011

Assessing Cognitive Randomness: A Kolmogorov Complexity Approach

[BibT_eX]

[DOI]

CoRR, 2011

2010

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

[BibT_eX]

[DOI]

CoRR, 2010

Image information content characterization and classification by physical complexity

[BibT_eX]

[DOI]

Cédric Gaucherel

CoRR, 2010

2009

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

[BibT_eX]

[DOI]

Francesco De Comité

CoRR, 2009

On the Algorithmic Nature of the World

[BibT_eX]

[DOI]

CoRR, 2009

2008

Networks of Communities and Evolution of Cooperation.

[BibT_eX]

[DOI]

Rémi Dorat

Int. J. Bifurc. Chaos, 2008

Towards a stable definition of Kolmogorov-Chaitin complexity

[BibT_eX]

[DOI]

CoRR, 2008

2007

On the Kolmogorov-Chaitin Complexity for short sequences

[BibT_eX]

[DOI]

Héctor Zenil

CoRR, 2007

2000

A Stamping Technique to Increase the Error Correction Capacity of the (127, k, d) RS Code.

[BibT_eX]

[DOI]

Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW 2000), 2000

The Iterated Lift Dilemma.

[BibT_eX]

[DOI]

Bruno Beaufils

Proceedings of the Computational Conflicts, 2000

1999

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

[BibT_eX]

[DOI]

Jean-Stéphane Varré

Eric Rivals

Bioinform., 1999

Studies on Dynamics in the Classical Iterated Prisoner's Dilemma with Few Strategies.

[BibT_eX]

[DOI]

Bruno Beaufils

Proceedings of the Artificial Evolution, 4th European Conference, 1999

1998

Optimal Representation in Average Using Kolmogorov Complexity.

[BibT_eX]

[DOI]

Eric Rivals

Theor. Comput. Sci., 1998

The transformation distance: A dissimilarity measure based an movements of segments.

[BibT_eX]

Jean-Stéphane Varré

Eric Rivals

Proceedings of the German Conference on Bioinformatics, 1998

Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma.

[BibT_eX]

[DOI]

Bruno Beaufils

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.

[BibT_eX]

[DOI]

Comput. Appl. Biosci., 1997

1996

A Guaranteed Compression Scheme for Repetitive DNA Sequences.

[BibT_eX]

[DOI]

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1994

A Kind of Logical Compilation for Knowledge Bases.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

A Kind of Achievement by Parts Method.

[BibT_eX]

[DOI]

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.

[BibT_eX]

Proceedings of the 2èmes Journées Francophones de Programmation Logique (JFPL 93), 1993

1992

The grand loop semantics for logic programs.

[BibT_eX]

Eric Wegrzynowski

Proceedings of the CNKBS'92, 1992

1991

Is there an Axiomatic Semantics for Standard Pure Prolog.

[BibT_eX]

[DOI]

François Denis

Theor. Comput. Sci., 1991

Programming in Three-valued Logic.

[BibT_eX]

[DOI]

V. Thibau

Theor. Comput. Sci., 1991

Unfolding, Procedural and Fixpoint Semantics of Logic Programs.

[BibT_eX]

[DOI]

François Denis

Proceedings of the STACS 91, 1991

1990

A new model semantics for a program with negation.

[BibT_eX]

V. Thibau

Proceedings of the SPLT'90, 1990

Operational semantics of Standard Prolog: an axiomatic approach.

[BibT_eX]

François Denis

Proceedings of the SPLT'90, 1990

The Logical Compilation of Knowledge Bases.

[BibT_eX]

[DOI]

Proceedings of the Logics in AI, European Workshop, 1990

The Optimal Model of a Program with Negation.

[BibT_eX]

[DOI]

V. Thibau

Proceedings of the Logics in AI, European Workshop, 1990

1989

Logique Partielle et Prolog.

[BibT_eX]

Proceedings of the SPLT'89, 1989

1988

Sémantique Logique Et Dénotationnelle Des Interpréteurs Prolog.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1988

Stratégie générale d'exploration et coupe-choix.

[BibT_eX]

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.

[BibT_eX]

Proceedings of the SPLT'87, 1987

1986

Définitions de stratégies équitables en programmation logique.

[BibT_eX]

P. Paradinas

Proceedings of the SPLT'86, 1986

1985

Sur Quelques Limitations des Algorithmes Dans Le Traitement des Suites.

[BibT_eX]

[DOI]