Publication

Multiple Heterogeneous Ant Colonies with Information Exchange

Related publications (54)

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.

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...

2006

Tracking Atoms with Particles

Pierre Vandergheynst, Gianluca Monaci, Emilio Maggio

We present a general framework and an efficient algorithm for tracking relevant video structures. The structures to be tracked are implicitly defined by a Matching Pursuit procedure that extracts and ranks the most important image contours. Based on the ra ...

2006

Optimistic Algorithms for Partial Database Replication

Nicolas Schiper, Rodrigo Malta Schmidt, Fernando Pedone

In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which req ...

2006

Multicoordinated Paxos

Rodrigo Malta Schmidt, Fernando Pedone

Classic Paxos is a round-based distributed consensus algorithm. Normally, proposals are sent to the round leader and decided in two communication steps more. Fast Paxos extends Classic Paxos by allowing also fast rounds, in which a decision can be learned ...

2006

Approximations in Distributed Optimization

Boi Faltings, Adrian Petcu

We present in this paper an approximative method for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation method and requires a linear number of messages. The largest message is in the worst c ...

2005

Monocular 3-D Tracking of the Golf Swing

Pascal Fua, Raquel Urtasun

We propose an approach to incorporating dynamic models into the human body tracking process that yields full 3--D reconstructions from monocular sequences. We formulate the tracking problem is terms of minimizing a differentiable criterion whose differenti ...

2004

Co-Evolutionary Particle Swarm Optimization Applied to the 7x7 Seega Game

Sara Mitri

Seega is an ancient Egyptian two-stage board game that, in certain aspects, is more difﬁcult than chess. The two-player game is most commonly played on a 7 × 7 board, but is also sometimes played on a 5 × 5 or 9 × 9 board. In the ﬁrst and more difﬁcult sta ...

2004

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

Applying Co-Evolutionary Particle Swam Optimization to the Egyptian Board Game Seega

Sara Mitri

Seega is an ancient Egyptian two-phase board game that, in certain aspects, is more difﬁcult than chess. The two-player game is played on either a 5 × 5, 7 × 7, or 9 × 9 board. In the ﬁrst and more difﬁcult phase of the game, players take turns placing one ...

2003

Fast Indulgent Consensus with Zero Degradation

Rachid Guerraoui, Partha Dutta

This paper describes a new consensus algorithm for the asynchronous message passing system model augmented with an unreliable failure detector abstraction: channels are reliable, processes can fail by crashing, and the detection of crashes are not reliable ...

2002