DE eng

Search in the Catalogues and Directories

Hits 1 – 8 of 8

1
Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems
In: 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2012) ; https://hal.inria.fr/hal-00758597 ; 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2012), Oct 2012, Toronto, Canada. pp.239-252, ⟨10.1007/978-3-642-33536-5_24⟩ (2012)
BASE
Show details
2
Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems
In: https://hal.inria.fr/hal-00714775 ; [Research Report] 2012 (2012)
BASE
Show details
3
Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems ...
BASE
Show details
4
Peer-to-Peer Service Discovery for Grid Computing
In: Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications ; https://hal.archives-ouvertes.fr/hal-01298352 ; Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications, IGI Global, Information Science Publishing, 2009, ⟨10.4018/978-1-61520-686-5.ch012⟩ (2009)
BASE
Show details
5
A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems
In: https://hal.inria.fr/inria-00115997 ; [Research Report] RR-6029, LIP RR-2006-34, INRIA, LIP. 2006, pp.15 (2006)
BASE
Show details
6
Circle Formation of Weak Robots and Lyndon Words
In: https://hal.archives-ouvertes.fr/hal-00069724 ; 2006 (2006)
BASE
Show details
7
A repair mechanism for fault-tolerance for tree-structured peer-to-peer systems
BASE
Show details
8
Circle Formation of Weak Robots and Lyndon Words ...
Dieudonné, Yoann; Petit, Franck. - : arXiv, 2006
Abstract: A Lyndon word is a non-empty word strictly smaller in the lexicographic order than any of its suffixes, except itself and the empty word. In this paper, we show how Lyndon words can be used in the distributed control of a set of n weak mobile robots. By weak, we mean that the robots are anonymous, memoryless, without any common sense of direction, and unable to communicate in an other way than observation. An efficient and simple deterministic protocol to form a regular n-gon is presented and proven for n prime. ... : 13 pages ...
Keyword: C.2.4; Distributed, Parallel, and Cluster Computing cs.DC; FOS Computer and information sciences; Robotics cs.RO
URL: https://arxiv.org/abs/cs/0605096
https://dx.doi.org/10.48550/arxiv.cs/0605096
BASE
Hide details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
8
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern