Concept

Langage algébrique déterministe

Publications associées (42)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Energy-efficient Continuous Context Sensing on Mobile Phones

Julien Eberle

With the ever increasing adoption of smartphones worldwide, researchers have found the perfect sensor platform to perform context-based research and to prepare for context-based services to be also deployed for the end-users. However, continuous context se ...

EPFL2015

Staged parser combinators for efficient data processing

Martin Odersky, Tiark Rompf, Sandro Stucki, Manohar Jonnalagedda, Thierry Coppey

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to b ...

ACM Press2014

Staged Parser Combinators for Efficient Data Processing

Martin Odersky, Tiark Rompf, Sandro Stucki, Manohar Jonnalagedda, Thierry Coppey

Assoc Computing Machinery2014

Randomized versus Deterministic Implementations of Concurrent Data Structures

Dan Alistarh

One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...

EPFL2012

State Machine Replication

Nuno Filipe de Sousa Santos

Since their invention more than half a century ago, computers have gone from being just an handful of expensive machines each filling an entire room, to being an integral part of almost every aspect of modern life. Nowadays computers are everywhere: in our ...

EPFL2012

The Complexity of Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

We study the complexity of renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct names from a given namespace. We prove an individual lower bound of Omega(k) process steps for deterministic renaming into ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

On the Precision of Circadian Oscillators

Thomas d'Eysmond

Precision is a crucial property of noisy circadian oscillators that can be quantified by the quality factor (Q). Until now, deterministic properties of circadian oscillations like the period or amplitude attracted most of the attention while relatively few ...

EPFL2011

Structuring and integrating human knowledge in demand forecasting: a judgemental adjustment approach

Naoufel Cheikhrouhou

Demand forecasting consists of using data of the past demand to obtain an approximation of the future demand. Mathematical approaches can lead to reliable forecasts in deterministic context through extrapolating regular patterns in time-series. However, un ...

Taylor & Francis2010

Improved estimation of travel demand from traffic counts by a new linearization of the network loading map

Michel Bierlaire, Gunnar Flötteröd

Abstract In the context of dynamic traffic assignment (DTA), the network loading map represents a traffic flow model. Assuming that an iterative DTA microsimulator is given, this article discusses several techniques for the linearization of the network loa ...

2009

Planner9, a HTN planner distributed on groups of miniature mobile robots

Francesco Mondada, Stéphane Magnenat, Martin Voelkle

Autonomous mobile robots are promising tools for operations in environments that are difficult to access for humans. When these environments are dynamic and non-deterministic, like in collapsed buildings, the robots must coordinate their actions and the us ...

Springer2009