Výsledky vyhledávání - "Julien Cervelle"

Study of Stepwise Simulation Between ASM

Autor: Julien Cervelle, Patrick Cegielski

Publikováno v: 15th Conference on Computability in Europe
15th Conference on Computability in Europe, Jul 2019, Durham, United Kingdom. pp.156-167
Computing with Foresight and Industry ISBN: 9783030229955
CiE

In this paper we study the notion of stepwise simulation between Abstract State Machines, to explore if some natural change on the original definition would keep it sound. We prove that we have to keep the classical notion and give results about the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7dc2540e87773cd7a44f0dc164bfa640
https://hal.archives-ouvertes.fr/hal-02182747

Zobrazit plný text záznamu

On shift-invariant maximal filters and hormonal cellular automata

Autor: Julien Cervelle, Gregory Lafitte

Publikováno v: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science
LICS: Logic in Computer Science
LICS: Logic in Computer Science, Jun 2017, Reykjavik, Iceland. pp.1-10, ⟨10.1109/LICS.2017.8005145⟩

International audience; This paper deals with the construction of shift-invariant maximal filters on ℤ and their relation to hormonal cellular automata, a generalization of the cellular automata computation model with some information about the glo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f99fff2f1d6d673da853384e5796182
https://hal.archives-ouvertes.fr/hal-01615278

Zobrazit plný text záznamu

Banzai+Tatoo: Using cutting-edge parsers for implementing high-performance servers

Autor: Gautier Loyauté, Gilles Roussel, Julien Cervelle, Rémi Forax

Publikováno v: Science of Computer Programming
Science of Computer Programming, Elsevier, 2012, 77 (9), pp.990-1005

This paper presents how the Tatoo parser generator enables the implementation of Java high-performance servers using the Banzai generic server shell. The performance of these servers relies on the ability of Tatoo to produce push non-blocking parsers

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ab6b3cab7315669ab1d3b9881bc2345

Zobrazit plný text záznamu

A simple implementation of grammar libraries

Autor: Julien Cervelle, Gilles Roussel, Rémi Forax

Publikováno v: Computer Science and Information Systems
Computer Science and Information Systems, ComSIS Consortium, 2007, 4 (2), pp.65-77

This paper presents an extension of the Tatoo compiler compiler that supports separate compilation and dynamic linking of formal grammars. It allows the developer to define reusable libraries of grammars such as those of arithmetic expressions or of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c19aa2d9019e871e9c09a0fa7083de10
https://doi.org/10.2298/csis0702065c

Zobrazit plný text záznamu

Entropy Games and Matrix Multiplication Games

Autor: Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor Kozyakin

Publikováno v: HAL

Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a-half players: Despot, Tribune and the non-deterministic People. Despot

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2aa4500a6b2d168da5701d9a798b3881
https://hal.archives-ouvertes.fr/hal-01164086v3/document

Zobrazit plný text záznamu

Entropy Games

Autor: Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor Kozyakin

Publikováno v: CoRR
CoRR, 2015, abs/1506.04885
BASE-Bielefeld Academic Search Engine
HAL

International audience; no abstract

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::463568d89c9dd0b5b303787227653546
https://hal.archives-ouvertes.fr/hal-01699930

Zobrazit plný text záznamu

Covering space in the Weyl and Besicovitch topologies

Autor: Julien Cervelle

Publikováno v: Inf. Comput.
Inf. Comput., 2014, 239, pp.44--54. ⟨10.1016/j.ic.2014.08.007⟩

This paper studies how one can spread points in the Besicovitch and Weyl spaces in order to keep them far one from another. We first study the general case and then what happens if the chosen points are all regular Toeplitz configurations or all quas

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a3e6a6d7c8a8c78a258723bae656436
https://hal.archives-ouvertes.fr/hal-01208376

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání