Synchronizing the Squad with (Almost) Arbitrary Cut Ratio

Abstract : In this paper, we design a solution to the generalized firing squad problem where the splittings can be chosen to happen at any ratio greater than two thirds. This is in the same spirit as the (non-generalized) solutions of Mazoyer except that we do not use signal speeds but the concept of fields to achieve this goal. Signals and speeds do appear visually as an effect of the spatio-temporal structure of the cellular automaton. However, not being setup by design allows the solution to automatically extends to more generalized settings. Moreover, the conceptual design of the solution is separated from the state space optimization that is only handle afterward. The finiteness of state space is also sketched.
Type de document :
Communication dans un congrès
Fourth International Symposium on Computing and Networking, CANDAR 2016, Hiroshima, Japan, November 22-25, 2016, 2016, Hiroshima, Japan. IEEE, pp.229--235, 2016, 2016 Fourth International Symposium on Computing and Networking (CANDAR) 〈http://is-candar.org/candar16/〉. 〈10.1109/CANDAR.2016.0048〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01799305
Contributeur : Luidnel Maignan <>
Soumis le : jeudi 24 mai 2018 - 15:31:05
Dernière modification le : jeudi 13 décembre 2018 - 15:26:38

Identifiants

Collections

Citation

Luidnel Maignan, Jean-Baptiste Yunès. Synchronizing the Squad with (Almost) Arbitrary Cut Ratio. Fourth International Symposium on Computing and Networking, CANDAR 2016, Hiroshima, Japan, November 22-25, 2016, 2016, Hiroshima, Japan. IEEE, pp.229--235, 2016, 2016 Fourth International Symposium on Computing and Networking (CANDAR) 〈http://is-candar.org/candar16/〉. 〈10.1109/CANDAR.2016.0048〉. 〈hal-01799305〉

Partager

Métriques

Consultations de la notice

79