A problem of multi-agent description of a complex object is under consideration. It is supposed that an object may be described in the terms of its parts properties and relations between these parts. But every agent has only a part of the object description and does not know the true names of elements and gives them names arbitrary. An algorithm solving the posed problem is described and the upper bound of its steps are proved.
|Страницы (с-по)||338 – 346|
|Журнал||International Journal on Information Theory and Applications|
|Состояние||Опубликовано - 2016|
|Опубликовано для внешнего пользования||Да|