Concept

Problème des lecteurs et des rédacteurs

Publications associées (10)

Streaming Principal Component Analysis From Incomplete Data

Linear subspace models are pervasive in computational sciences and particularly used for large datasets which are often incomplete due to privacy issues or sampling constraints. Therefore, a critical problem is developing an efficient algorithm for detecti ...

MICROTOME PUBL2019

Interactive optimization for supporting multicriteria decisions in urban and energy system planning

Sébastien Cajot

Climate change and growing urban populations are increasingly putting pressure on cities to reduce their carbon emissions and transition towards efficient and renewable energy systems. This challenges in particular urban planners, who are expected to integ ...

EPFL2018

Constraint-Flow Nets: A Model for Building Constraints from Resource Dependencies

Simon Bliudze, Alena Simalatsar, Alina Zolotukhina

The major research in the resource management literature focuses primarily on two complementary sub-problems: (1) specification languages for formulating resource requests and (2) constraint problems modelling allocation and scheduling. Both directions ass ...

Springer International Publishing2017

Modelling Resource Dependencies

Simon Bliudze, Alena Simalatsar, Alina Zolotukhina

The major research in the resource management literature focuses primarily on two directions: 1) specification languages for formulating resource requests and 2) constraint problems modelling allocation and scheduling. Both directions assume the knowledge ...

2016

Upper bounds for the reach-avoid probability via robust optimization

Maryam Kamgarpour, John Lygeros, Tyler Summers

We consider finite horizon reach-avoid problems for discrete time stochastic systems. Our goal is to construct upper bound functions for the reach-avoid probability by means of tractable convex optimization problems. We achieve this by restricting attentio ...

2015

Automated Classification of Data Races Under Both Strong and Weak Memory Models

George Candea, Cristian Zamfir, Baris Can Cengiz Kasikci

Data races are one of the main causes of concurrency problems in multithreaded programs. Whether all data races are bad, or some are harmful and others are harmless, is still the subject of vigorous scientific debate [Narayanasamy et al. 2007; Boehm 2012]. ...

Assoc Computing Machinery2015

Introducing Speculation in Self-Stabilization: An Application to Mutual Exclusion

Rachid Guerraoui

Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits correct behavior. Speculation consists in guaranteeing that the system satisfies its requirements for any execution but exhibits signif ...

2013

Addressing the ZooKeeper Synchronization Inefficiency

André Schiper, Babak Kalantari

In this paper we discuss the problem of synchronization in ZooKeeper, a fault-tolerant distributed coordination framework. One of the key features of ZooKeeper is to move away from blocking API such as locks, in order to avoid problems with slow or faulty ...

2012

Statistical characteristics of transitional queue conditions in signalized arterials

Nikolaos Geroliminis

The performance of signalized arterials is related to queuing phenomena. The paper investigates the effect of transitional traffic flow conditions imposed by the formation and dissipation of queues. A cross-recurrence quantification analysis combined with ...

Elsevier2007

Architecture de systèmes dans l'environnement MMS

"Manufacturing Message Specification" (MMS) is an OSI application layer protocol that allows remote applications (called clients) to control and supervise various heterogeneous industrial devices (called servers). MMS is becoming widely accepted as the mai ...

EPFL1996

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