Publication

The Complexity of a Reliable Distributed System

Related publications (73)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Approximation of Event Probabilities in Noisy Cellular Processes

Maria-Emanuela-Canini Mateescu, Verena Wolf

Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculati ...

2009

GENERATING PROBABILISTIC PATH OBSERVATION FROM GPS DATA FOR ROUTE CHOICE MODELING

Michel Bierlaire, Jingmin Chen, Jeffrey Newman

Abstract: Map matching algorithms are the conventional way to generate path observations from GPS data for route choice models. The deterministic matching may introduce extra biases to parameters of route choice models if the matching is wrong. In this pap ...

2009

Approximation of Event Probabilities in Noisy Cellular Processes

Maria-Emanuela-Canini Mateescu, Verena Wolf

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Convexity bounds for BSDE solutions, with applications to indiﬀerence valuation

Christoph Frei, Semyon Malamud

We consider backward stochastic diﬀerential equations (BSDEs) with a particular quadratic generator and study the behaviour of their solu- tions when the probability measure is changed, the ﬁltration is shrunk, or the underlying probability space is transf ...

2009

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009

A quasi-dynamic capacity constrained frequency-based transit assignment model

This paper presents a first approach to dynamic frequency-based transit assignment. As such the model aims to close the gap between schedule-based and frequency-based models. Frequency-based approaches have some advantages compared to schedule-based models ...

Elsevier2008

Fountain codes for piecewise stationary channels

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...

IEEE2008

An integrated adaptive model for overheating risk prediction

Darren Robinson, Frédéric Haldi

Based on the results from a field survey campaign, this article describes three new developments which have been integrated to provide a comprehensive basis for the evaluation of overheating risk in offices. Firstly, a set of logistic regression equations ...

2008

A Class Of Mean Field Interaction Models for Computer and Communication Systems

Jean-Yves Le Boudec

We consider models of N interacting objects, where the interaction is via a common resource and the distribution of states of all objects. We introduce the key scaling concept of intensity; informally, the expected number of transitions per object per time ...

2008

Simple learning rules to cope with changing environments

Roderich Gross

We consider an agent that must choose repeatedly among several actions. Each action has a certain probability of giving the agent an energy reward, and costs may be associated with switching between actions. The agent does not know which action has the hig ...

2008

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009