Results 1  10
of
256
Election and rendezvous with incomparable labels
 Theoretical Computer Science
"... 351 cours de la Libération ..."
Rendezvous and election of mobile agents: impact of sense of direction

, 2005
"... Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node to neighbouring node. At each node there is a whiteboard where the agents can write and read from. The topology of the ne ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
of deterministic generic solutions, i.e., algorithms that solve the two problems regardless of the network topology and the initial placement of the agents. In particular, we study the impact of edgelabeling on the existence of such solutions. Rendezvous and election are unsolvable (i
Rendezvous of Mobile Agents without Agreement on Local Orientation
"... Abstract. The exploration of a connected graph by multiple mobile agents has been previously studied under different conditions. A fundamental coordination problem in this context is the gathering of all agents at a single node, called the Rendezvous problem. To allow deterministic exploration, it i ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
instances where rendezvous is solvable under a common local orientation function. This result is surprising and extends the known characterization of solvable instances for rendezvous and leader election in anonymous networks. On one hand, our model is more general than the anonymous porttoport network
Election in the Qualitative World
, 2006
"... In [3], Barrière et al. consider a qualitative model of distributed computing, where the labels of the entities are distinct but mutually incomparable. They study the leader election problem in a distributed mobile environment and they wonder whether there exists an algorithm such that for each dis ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In [3], Barrière et al. consider a qualitative model of distributed computing, where the labels of the entities are distinct but mutually incomparable. They study the leader election problem in a distributed mobile environment and they wonder whether there exists an algorithm such that for each
Can We Elect If We Cannot Compare?
 IN PROC. 15TH ACM SYMP. ON PARALLEL ALGORITHMS AND ARCHITECTURES (SPAA’03
, 2003
"... The aim of this paper is to study the computational power of the qualitative model, where entities are given distinct labels which are however mutually incomparable; this model is opposed to the quantitative model, where labels are integers. The qualitative model captures, for example, the case when ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
weakest setting: anonymous highly symmetric networks (i.e., Cayley graphs). In this way, to break the symmetry (and thus elect a leader) among the incomparable mobile agents, we can not rely on the existence of distinguished node labels nor on any topological asymmetry of the network. We describe a
Effective elections for anonymous mobile agents
 In Proc. 17th International Symposium on Algorithms and Computation (ISAAC’06
, 2006
"... Abstract. We present distributed protocols for electing a leader among k mobile agents that are dispersed among the n nodes of a graph. While previous solutions for the agent election problem were restricted to specific topologies or under specific conditions, the protocols presented in this paper f ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
face the problem in the most general case, i.e. for an arbitrary topology where the nodes of the graph may not be distinctly labelled and the agents might be all identical (and thus indistinguishable from each other). In such cases, the agent election problem is often difficult, and sometimes
Distributed Exploration of Unlabelled Graphs by Multiple Agents ∗
"... We consider a distributed version of the typical graph exploration problem where a mobile agent has to traverse the edges of an unlabelled (i.e., anonymous) graph and return to its starting point, building a map of the graph in the process. In our case, instead of a single agent, there are k identic ..."
Abstract
 Add to MetaCart
the problem under the condition that the values of n and k are coprime to each other. We also show how the problem of Labelled Map construction is related to other problems like leader election and rendezvous of agents.
On the power of synchronization between two adjacent processes
, 2010
"... We study the power of local computations on labelled edges (which allow two adjacent vertices to synchronize and to modify their states simultaneaously in function of their previous states) through the classical election problem. We characterize the graphs for which this problem has a solution. As c ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We study the power of local computations on labelled edges (which allow two adjacent vertices to synchronize and to modify their states simultaneaously in function of their previous states) through the classical election problem. We characterize the graphs for which this problem has a solution
Extensions of Basic Process Calculi
"... 1 Programme of these lectures • The first part of the course has focused on a basic process calculus (CCS) representing at an abstract level systems of asynchronous processes interacting through synchronous channels (rendezvous). • Some things you (should) have learned: – The notion of labelled tra ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
1 Programme of these lectures • The first part of the course has focused on a basic process calculus (CCS) representing at an abstract level systems of asynchronous processes interacting through synchronous channels (rendezvous). • Some things you (should) have learned: – The notion of labelled
The Ethics of Killing: Problems at the Margins of Life
, 2002
"... Oxford is a registered trademark of Oxford University Press All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
Oxford is a registered trademark of Oxford University Press All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise,
Results 1  10
of
256