Concept

Jeu de la vie

Publications associées (9)

Incommensurate phases

Gervais Chapuis

Incommensurately modulated crystalline phases are part of a more general family called aperiodic crystals. Their symmetry is treated within the theoretical framework of superspace groups that is a generalization of the 3D space groups that are used for con ...
Academic Press2024

Generalizing State Machine Replication

Rachid Guerraoui

We show that, with k-set consensus, any number of processes can emulate k state machines of which at least one progresses. This generalizes the celebrated universality of consensus which enables to build a state machine that always progresses. Besides some ...
2010

Expressiveness and Closure Properties for Quantitative Languages

Laurent Doyen

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the ma ...
2008

Algorithms for Interface Synthesis

Vasu Singh, Dirk Thilo Beyer

A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We compare and evaluate three different algorithms for automatically extracting temporal interfac ...
Springer2007

Information Visualization of Multi-dimensional Cellular Automata using GPU Programming

Stéphane Gobron

We propose a method for generating all possible rules of multidimension Boolean cellular automata (CA). Based on an original encoding method and the programming of graphical processor units (GPU), this method allows us to visualize the CA information flow ...
IEEE Computer Society2007

Three Algorithms for Interface Synthesis: A Comparative Study

Vasu Singh, Dirk Thilo Beyer

A temporal interface for a system component is a finite automaton that specifies the legal sequences of input events. We evaluate and compare three different algorithms for automatically extracting the temporal interface from the transition graph of a comp ...
2006

Tom Thumb Algorithm and von Neumann Universal Constructor

Joël Rossier, Enrico Petraglio

This article describes the addition to the von Neumann cellular automaton of the Tom Thumb Algorithm, a mechanism developed for the self-replication of multi-processor systems. Except for the cell construction process, every functionality of the original C ...
2004

Fundamentals of adaptive filtering

Ali H. Sayed

This graduate-level textbook offers a comprehensive and up-to-date treatment of adaptive filtering; a vast and fast-moving field. The book is logically organized, specific in its presentation of each topic, and far-reaching in scope. Throughout the present ...
John Wiley & Sons2003

Self-Organized Fractal River Networks

Andrea Rinaldo

Optimal channel networks (OCN's) obtained by minimizing the local and global rates of energy expenditure evolve automatically from arbitrary initial conditions to network configurations exhibiting fractal and multifractal statistics indistinguishable from ...
1993

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.