Publication

Liberalization and Competition in Postal Markets: Decentralized Infrastructure versus Cherry Picking

Publications associées (157)

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

Consensus when all processes may be Byzantine for some time

Martin Hutle, Martin Biely

Among all classes of faults, Byzantine faults form the most general modeling of value faults. Traditionally, in the Byzantine fault model, faults are statically attributed to a set of up to t processes. This, however, implies that in this model a process a ...

2011

How Important is the Detection of Changes in Active Constraints in Real-Time Optimization?

Dominique Bonvin, Saurabh Anand Deshpande

In real-time optimization, enforcing the constraints that need to be active is important for optimality. In fact, it has been established in the context of parametric variations that, if these constraints are not satisfied, the optimality loss would be O($ ...

2011

A Framework to Model and Analyze the WHY and the HOW of Coopetition

Alain Wegmann, Arash Golnam, Ron Sanchez

Coopetition has been defined as an approach to managing that combines competition and cooperation. It transcends the traditional paradigms of competition and cooperation in an effort to achieve the advantages of both. As an inter-organizational relationshi ...

2011

Priming With Two Primes : The Interaction of Prime and Target Features

Julianne Grainger

In response priming, the reaction times to classify an object can be affected by previous exposure to a similar object. Most priming experiments focus on how primes prime a target. In the following set of experiments, we investigate how the interaction bet ...

2011

Performance Evaluation of Computer and Communication Systems

Jean-Yves Le Boudec

This book is the set of lecture notes for a course given at EPFL. It contains all the material needed by an engineer who wishes to evaluate the performance of a computer or communication system. ...

EPFL Press2010

Hitting Simplices with Points in $R^3$

Abdul Basit

The so-called first selection lemma states the following: given any set P of n points in a"e (d) , there exists a point in a"e (d) contained in at least c (d) n (d+1)-O(n (d) ) simplices spanned by P, where the constant c (d) depends on d. We present impro ...

2010

How Experience Shapes the Subjective Evaluation of Opportunities

Marc Gruber, Sun Hee Kim

The purpose of this paper is to build on a set of recent theoretical studies investigating the role of subjective insights and judgments in the resource-based view and to extend this important line of inquiry by offering a detailed assessment of how agents ...

2010

On Source Transmission over Deterministic Relay Networks

Suhas Diggavi

Lossless transmission of a set of correlated sources over a deterministic relay network is considered for two traffic requirements. In distributed multicast, the set of sources are to be delivered to a set of destinations. The source exchange requires all ...

2010

Propagation of geotags based on object duplicate detection

Touradj Ebrahimi, Jong Seok Lee, Lutz Goldmann, Ivan Ivanov, Péter Vajda

In this paper, we consider the use of object duplicate detection for the propagation of geotags from a small set of images with location names (IPTC) to a large set of non-tagged images. The motivation behind this idea is that images of individual location ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2010

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