default search action
Jean-Paul Delahaye
Person information
- affiliation: Université de Lille
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Philippe Mathieu, Jean-Paul Delahaye:
Avons nous toujours besoin de stochasticité pour la simulation évolutionnaire ? JFSMA 2024: 171-180 - 2023
- [j21]Jean-Paul Delahaye, Philippe Mathieu:
Être ou ne pas être individualiste, quelles conséquences ? Rev. Ouverte Intell. Artif. 4(2): 67-95 (2023) - [j20]Philippe Mathieu
, Jean-Paul Delahaye
Softening and Hardening in the Iterated Prisoner's Dilemma. IEEE Trans. Syst. Man Cybern. Syst. 53(2): 654-663 (2023) - 2021
- [c23]Jean-Paul Delahaye, Philippe Mathieu:
Coopération généralisée et attracteurs au dilemme itéré du prisonnier. JFSMA 2021: 139-148
2010 – 2019
- 2019
- [j19]Philippe Mathieu
Experimental criteria to identify efficient probabilistic memory-one strategies for the iterated prisoner's dilemma. Simul. Model. Pract. Theory 97 (2019) - 2018
- [j18]Lin Ma
An Algorithmic Look at Financial Volatility. Algorithms 11(11): 185 (2018) - [j17]Jean-Paul Delahaye, Philippe Mathieu:
Stratégies probabilistes à mémoire de 1 coup au dilemme itéré du prisonnier. Rev. d'Intelligence Artif. 32(2): 141-167 (2018) - 2017
- [j16]Philippe Mathieu, Jean-Paul Delahaye:
New Winning Strategies for the Iterated Prisoner's Dilemma. J. Artif. Soc. Soc. Simul. 20(4) (2017) - [j15]Nicolas Gauvrit
Human behavioral complexity peaks at age 25. PLoS Comput. Biol. 13(4) (2017) - [c22]Jean-Paul Delahaye, Philippe Mathieu:
Que valent les stratégies probabilistes au dilemme itéré des prisonniers ? JFSMA 2017: 41-51 - 2016
- [c21]Jean-Paul Delahaye, Philippe Mathieu:
Méta-Stratégies pour le Dilemme Itéré du Prisonnier. JFSMA 2016: 13-22 - [i14]Jean-Paul Delahaye, Clement Vidal:
Organized Complexity: is Big History a Big Computation? CoRR abs/1609.07111 (2016) - 2015
- [j14]Olivier Brandouy, Jean-Paul Delahaye, Lin Ma
Estimating the algorithmic complexity of stock markets. Algorithmic Finance 4(3-4): 159-178 (2015) - [j13]Héctor Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit:
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility. PeerJ Comput. Sci. 1: e23 (2015) - [c20]Philippe Mathieu, Jean-Paul Delahaye:
New Winning Strategies for the Iterated Prisoner's Dilemma. AAMAS 2015: 1665-1666 - 2013
- [j12]Fernando Soler-Toscano, Hector Zenil
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. Comput. 2(2): 125-140 (2013) - 2012
- [j11]Jean-Paul Delahaye, Hector Zenil
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness. Appl. Math. Comput. 219(1): 63-77 (2012) - [j10]Hector Zenil, Jean-Paul Delahaye, Cédric Gaucherel:
Image characterization and classification by physical complexity. Complex. 17(3): 26-42 (2012) - [i13]Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit:
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines. CoRR abs/1211.1302 (2012) - [i12]Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit:
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. CoRR abs/1211.4891 (2012) - [i11]Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit:
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility. CoRR abs/1212.6745 (2012) - 2011
- [i10]Jean-Paul Delahaye, Hector Zenil:
Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness. CoRR abs/1101.4795 (2011) - [i9]Nicolas Gauvrit, Hector Zenil, Jean-Paul Delahaye:
Assessing Cognitive Randomness: A Kolmogorov Complexity Approach. CoRR abs/1106.3059 (2011) - [i8]Hector Zenil, Jean-Paul Delahaye:
Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas. CoRR abs/1108.5387 (2011) - [i7]Hervé Zwirn, Jean-Paul Delahaye:
Unpredictability and Computational Irreducibility. CoRR abs/1111.4121 (2011) - 2010
- [i6]Hector Zenil, Jean-Paul Delahaye, Cédric Gaucherel:
Image information content characterization and classification by physical complexity. CoRR abs/1006.0051 (2010) - [i5]Hector Zenil, Jean-Paul Delahaye:
An algorithmic information-theoretic approach to the behaviour of financial markets. CoRR abs/1008.1846 (2010)
2000 – 2009
- 2009
- [i4]Hector Zenil, Jean-Paul Delahaye:
On the Algorithmic Nature of the World. CoRR abs/0906.3554 (2009) - [i3]Francesco De Comité, Jean-Paul Delahaye:
A CounterExample to Kahle-Conjecture, New Conjectures and Automated Proofs in Geometry. CoRR abs/0911.4375 (2009) - 2008
- [j9]Rémi Dorat, Jean-Paul Delahaye:
Networks of Communities and Evolution of Cooperation. Int. J. Bifurc. Chaos 18(7): 2123-2131 (2008) - [i2]Jean-Paul Delahaye, Hector Zenil:
Towards a stable definition of Kolmogorov-Chaitin complexity. CoRR abs/0804.3459 (2008) - 2007
- [i1]Jean-Paul Delahaye, Héctor Zenil:
On the Kolmogorov-Chaitin Complexity for short sequences. CoRR abs/0704.1043 (2007) - 2000
- [c19]T. Vallino, Abbas Dandache, Jean-Paul Delahaye, Fabrice Monteiro, Bernard Lepley:
A Stamping Technique to Increase the Error Correction Capacity of the (127, k, d) RS Code. IOLTW 2000: 169-170 - [p1]Jean-Paul Delahaye, Philippe Mathieu, Bruno Beaufils:
The Iterated Lift Dilemma. Computational Conflicts 2000: 202-223
1990 – 1999
- 1999
- [j8]Jean-Stéphane Varré
Transformation distances: a family of dissimilarity measures based on movements of segments. Bioinform. 15(3): 194-202 (1999) - [c18]Philippe Mathieu, Bruno Beaufils, Jean-Paul Delahaye:
Studies on Dynamics in the Classical Iterated Prisoner's Dilemma with Few Strategies. Artificial Evolution 1999: 177-190 - 1998
- [j7]Eric Rivals, Jean-Paul Delahaye:
Optimal Representation in Average Using Kolmogorov Complexity. Theor. Comput. Sci. 200(1-2): 261-287 (1998) - [c17]Bruno Beaufils, Jean-Paul Delahaye, Philippe Mathieu:
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma. Evolutionary Programming 1998: 33-41 - [c16]Jean-Stéphane Varré, Jean-Paul Delahaye, Eric Rivals:
The transformation distance: A dissimilarity measure based an movements of segments. German Conference on Bioinformatics 1998 - 1997
- [j6]Eric Rivals
Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. Comput. Appl. Biosci. 13(2): 131-136 (1997) - 1996
- [c15]Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange:
A Guaranteed Compression Scheme for Repetitive DNA Sequences. Data Compression Conference 1996: 453 - 1994
- [j5]Philippe Mathieu
A Kind of Logical Compilation for Knowledge Bases. Theor. Comput. Sci. 131(1): 197-218 (1994) - [c14]Philippe Mathieu, Jean-Paul Delahaye:
A Kind of Achievement by Parts Method. LPAR 1994: 320-332 - 1993
- [c13]Jean-Paul Delahaye, Philippe Mathieu:
An achievement by part method to solve the incompleteness of forward chaining. JFPL 1993: 155-171 - 1992
- [c12]Eric Wegrzynowski, Jean-Paul Delahaye:
The grand loop semantics for logic programs. CNKBS 1992: 12-15 - [c11]Eric Wegrzynowski, Jean-Paul Delahaye:
The grand loop semantics for logic programs. JFPL 1992: 87-106 - [e1]Jean-Paul Delahaye, Philippe Devienne, Philippe Mathieu, Pascal Yim:
JFPL'92, 1ères Journées Francophones de Programmation Logique, 25-27 Mai 1992, Lille, France. 1992 [contents] - 1991
- [j4]Jean-Paul Delahaye, V. Thibau:
Programming in Three-valued Logic. Theor. Comput. Sci. 78(1): 189-216 (1991) - [j3]François Denis, Jean-Paul Delahaye:
Is there an Axiomatic Semantics for Standard Pure Prolog. Theor. Comput. Sci. 82(2): 373-388 (1991) - [c10]François Denis, Jean-Paul Delahaye:
Unfolding, Procedural and Fixpoint Semantics of Logic Programs. JTASPEFT/WSA 1991: 157-164 - [c9]François Denis, Jean-Paul Delahaye:
Unfolding, Procedural and Fixpoint Semantics of Logic Programs. STACS 1991: 511-522 - 1990
- [c8]Jean-Paul Delahaye, V. Thibau:
The Optimal Model of a Program with Negation. JELIA 1990: 180-195 - [c7]Philippe Mathieu
The Logical Compilation of Knowledge Bases. JELIA 1990: 386-398 - [c6]Jean-Paul Delahaye, François Denis:
Operational semantics of Standard Prolog: an axiomatic approach. SPLT 1990: 311- - [c5]Jean-Paul Delahaye, V. Thibau:
A new model semantics for a program with negation. SPLT 1990: 389-404
1980 – 1989
- 1989
- [c4]Jean-Paul Delahaye, Philippe Mathieu:
Logique Partielle et Prolog. SPLT 1989: 311- - 1988
- [j2]Jean-Paul Delahaye:
Sémantique Logique Et Dénotationnelle Des Interpréteurs Prolog. RAIRO Theor. Informatics Appl. 22(1): 3-42 (1988) - [c3]Jean-Paul Delahaye:
Stratégie générale d'exploration et coupe-choix. SPLT 1988: 337-360 - 1987
- [c2]Jean-Paul Delahaye:
Différences entre la sémantique déclarative et la sémantique procédurale d'un programme Prolog avec coupe-choix. SPLT 1987: 285-306 - 1986
- [c1]Jean-Paul Delahaye, P. Paradinas:
Définitions de stratégies équitables en programmation logique. SPLT 1986: 7-14 - 1985
- [j1]Jean-Paul Delahaye:
Sur Quelques Limitations des Algorithmes Dans Le Traitement des Suites. RAIRO Theor. Informatics Appl. 19(1): 3-20 (1985)
Coauthor Index
aka: Héctor Zenil
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 20:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: