Publication

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

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.

DISTAL: Domain-speciﬁc Language for Implementing Distributed Algorithms

Pamela Isabel Delgado Borda

Distributed algorithms research focuses on interactions and communication between independent systems and processors in diverse scenarios. These algorithms are usually written as abstract pseudo-code, and turning them into compilable and runnable code is a ...

2012

Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Boi Faltings, Immanuel Trummer

Various algorithms have been proposed for the problem of quality-driven service composition. They differ by the quality of the resulting executable processes and by their processing costs. In this paper, we study the problem of service composition from an ...

Springer-Verlag Berlin2011

A Fault-Tolerant Token based Atomic Broadcast Algorithm

André Schiper, Nils Richard Ekwall

Many atomic broadcast algorithms have been published in the last twenty years. Token based algorithms represent a large class of these algorithms. Interestingly, all the token based atomic broadcast algorithms rely on a group membership service and none of ...

2010

Tracking behavior of mobile adaptive networks

Ali H. Sayed

Adaptive networks consist of a collection of nodes with learning abilities that interact with each other locally in order to solve distributed processing and distributed inference problems in real-time. Various algorithms and performance analyses have been ...

IEEE2010

Stochastic Algorithm and Analysis of amino-acyl-tRNA Competition in Translation

Adam Stefaniuk

This work deals with the creation of a stochastic algorithm for aa-tRNA competition during translation using an abstraction of the biological model. The major challenges were to manage aa-tRNA specie specific input information in order to deal with eventua ...

2010

Constraint-specific recovery networks for solving airline recovery problems

Michel Bierlaire, Matteo Salani, Niklaus Eggenberg

In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework that allows the consideration of operational constraints within a Column Gen ...

2010

Neighbor Discovery in Wireless Networks and the Coupon Collector's Problem

Ramin Khalili

Neighbor discovery is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discovery in wireless networks. We first consider an ALOHA-like neighbor discovery algor ...

2009

Detecting the Origin of Text Segments Efficiently

Monika Henzinger

In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of k alphanumeric terms in D the earliest document in S in which the sequence ap ...

ACM2009

Algorithm/Architecture Co-Exploration of Visual Computing: Overview and Future Perspectives

Marco Mattavelli

Concurrently exploring both algorithmic and architectural optimizations is a new design paradigm. This survey paper addresses the latest research and future perspectives on the simultaneous development of video coding, processing, and computing algorithms ...

2009

The scale axis picture show

Mark Pauly

We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of a shape, in a scale-adaptive manner. Here a shape O is any bounded open subs ...

2009