The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Nous appelons un réseau un réseau anonyme, si chaque sommet du réseau ne reçoit aucun identifiant. Pour les algorithmes distribués pour réseaux anonymes, les problèmes résolubles dépendent fortement des conditions initiales données. Dans le passé, les conditions initiales ont été étudiées, par exemple, par calcul étant donné le nombre de sommets comme condition initiale, et en fonction de la condition initiale nécessaire pour élire un leader. Dans cet article, nous étudions les relations entre les conditions initiales. Pour réaliser cette tâche, nous définissons la relation entre les conditions initiales A et B (dénoté par A
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Naoshi SAKAMOTO, "Structure of Initial Conditions for Distributed Algorithms" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 12, pp. 2029-2038, December 2000, doi: .
Abstract: We call a network an anonymous network, if each vertex of the network is given no ID's. For distributed algorithms for anonymous networks, solvable problems depend strongly on the given initial conditions. In the past, initial conditions have been investigated, for example, by computation given the number of vertices as the initial condition, and in terms of what initial condition is needed to elect a leader. In this paper, we study the relations among initial conditions. To achieve this task, we define the relation between initial conditions A and B (denoted by A
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_12_2029/_p
Copier
@ARTICLE{e83-d_12_2029,
author={Naoshi SAKAMOTO, },
journal={IEICE TRANSACTIONS on Information},
title={Structure of Initial Conditions for Distributed Algorithms},
year={2000},
volume={E83-D},
number={12},
pages={2029-2038},
abstract={We call a network an anonymous network, if each vertex of the network is given no ID's. For distributed algorithms for anonymous networks, solvable problems depend strongly on the given initial conditions. In the past, initial conditions have been investigated, for example, by computation given the number of vertices as the initial condition, and in terms of what initial condition is needed to elect a leader. In this paper, we study the relations among initial conditions. To achieve this task, we define the relation between initial conditions A and B (denoted by A
keywords={},
doi={},
ISSN={},
month={December},}
Copier
TY - JOUR
TI - Structure of Initial Conditions for Distributed Algorithms
T2 - IEICE TRANSACTIONS on Information
SP - 2029
EP - 2038
AU - Naoshi SAKAMOTO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2000
AB - We call a network an anonymous network, if each vertex of the network is given no ID's. For distributed algorithms for anonymous networks, solvable problems depend strongly on the given initial conditions. In the past, initial conditions have been investigated, for example, by computation given the number of vertices as the initial condition, and in terms of what initial condition is needed to elect a leader. In this paper, we study the relations among initial conditions. To achieve this task, we define the relation between initial conditions A and B (denoted by A
ER -