Concept

Partial application

Publications associées (25)

Dividing Transactional Memories by Zero

Rachid Guerraoui, Michal Kapalka, Aleksandar Dragojevic

Software transactional memory (STM) is a promising technique for writing concurrent programs. So far, most STM approaches have been experimentally evaluated with small-scale microbenchmarks. In this paper, we present several surprising results from impleme ...

2008

Analytical modeling of the apparent d(33) piezoelectric coefficient determined by the direct quasistatic method for different boundary conditions

Nava Setter, Dragan Damjanovic

The longitudinal piezoelectric coefficient d(33) measured by the quasistatic (Berlincourt-type) method is strongly dependent on the sample aspect ratio (thickness/lateral dimension) and the type of contacts used to collect the charge and apply the pressure ...

2005

Independently Extensible Solutions to the Expression Problem

Martin Odersky, Matthias Zenger

The expression problem is fundamental for the development of extensible software. Many (partial) solutions to this important problem have been proposed in the past. None of these approaches solves the problem of using different, independent extensions jo ...

2004

Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times

Jean-Yves Le Boudec, Milan Vojnovic, Catherine Boutremans

Consider a network with an arbitrary topology and arbitrary communication delays, in which congestion control is based on additive--increase and multiplicative--decrease. We show that the source rates tend to be distributed in order to maximize an objectiv ...

2000

Global Fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times

Jean-Yves Le Boudec, Milan Vojnovic, Catherine Boutremans

Consider a network with an arbitrary topology and arbitrary communication delays, in which congestion control is based on additive-increase and multiplicative-decrease. We show that the source rates tend to be distributed in order to maximize an objective ...

1999

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