Concept

Adresse IPv6

Publications associées (186)

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

Handling Identity in Peer-to-Peer Systems

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

Due to the limited number of available IP addresses most computers on the Internet use dynamic IP addresses which causes problems for applications that have to maintain rout-ing tables, for example, peer-to-peer systems. To overcome this we propose unique ...

2003

Programmable code processor for software defined radio

Andreas Peter Burg

This paper describes a flexible processor capable of producing binary codes for various standards such as UNITS and 802.11b. Its field of application lies in base-stations and in future software defined radio terminals. Because of its flexibility just one ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2003

Early Local Decisions in Distributed Agreement

Rachid Guerraoui, Bastian Pochon, Partha Dutta

When devising a distributed agreement algorithm, it is common to minimize the time complexity of global decisions, which is typically measured as the number of communication rounds needed for all correct processes to decide. In practice, what we might want ...

2003

The Agentcities Network Architecture

Ion Constantinescu, Steven Nicolas Willmott

Agentcities is a worldwide initiative designed to help realize the commercial and research potential of agent-based applications by constructing an open distributed network of platforms hosting diverse agents and services. The ultimate aim of the Agentciti ...

2002

Scalable routing protocols with applications to mobility

Ljubica Blazevic

In this thesis we study two routing problems related to mobility. The first problem concerns scalable multicast routing when there is a large number of multicast groups with a small number of receivers. Existing dense and sparse mode routing protocols have ...

EPFL2002

AOP: Does it Make Sense ? The Case of Concurrency and Failures

Rachid Guerraoui, Jörg Kienzle

Concurrency and failures are fundamental problems in distributed computing. One likes to think that the mechanisms needed to address these problems can be separated from the rest of the distributed application: in modern words, these mechanisms could be as ...

2002

AOP - Does It Make Sense? The Case of Concurrency and Failures

Rachid Guerraoui, Jörg Kienzle

Springer Verlag2002

How to choose the number of taps in a DFE?

Christina Fragouli

In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simp ...

2002

Gauging the Quality of Examples for Teaching Design Patterns

Shane Sendall

What constitutes a good example in the context of teaching design patterns? How can instructors judge whether one example is better than another one for teaching a design pattern to students? How might an example be presented to best connect with students, ...

2002

Gauging the Quality of Examples for Teaching Design Patterns

Shane Sendall

2002