The mobile agent rendezvous problem in the ring

Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This...

Descripción completa

Detalles Bibliográficos
Autores principales: Kranakis, Evangelos, Krizanc, Danny, Marcou, Euripides
Lenguaje:eng
Publicado: Morgan & Claypool Publ. 2010
Materias:
Computing and Computers
Acceso en línea:http://cds.cern.ch/record/2018666
_version_ 1780946764196478976
author Kranakis, Evangelos
Krizanc, Danny
Marcou, Euripides
author_facet Kranakis, Evangelos
Krizanc, Danny
Marcou, Euripides
author_sort Kranakis, Evangelos
collection CERN
description Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same n
id cern-2018666
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2010
publisher Morgan & Claypool Publ.
record_format invenio
spelling cern-20186662021-04-21T20:18:46Zhttp://cds.cern.ch/record/2018666engKranakis, EvangelosKrizanc, DannyMarcou, EuripidesThe mobile agent rendezvous problem in the ringComputing and ComputersMobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same nMorgan & Claypool Publ.oai:cds.cern.ch:20186662010
spellingShingle Computing and Computers
Kranakis, Evangelos
Krizanc, Danny
Marcou, Euripides
The mobile agent rendezvous problem in the ring
title The mobile agent rendezvous problem in the ring
title_full The mobile agent rendezvous problem in the ring
title_fullStr The mobile agent rendezvous problem in the ring
title_full_unstemmed The mobile agent rendezvous problem in the ring
title_short The mobile agent rendezvous problem in the ring
title_sort mobile agent rendezvous problem in the ring
topic Computing and Computers
url http://cds.cern.ch/record/2018666
work_keys_str_mv AT kranakisevangelos themobileagentrendezvousprobleminthering
AT krizancdanny themobileagentrendezvousprobleminthering
AT marcoueuripides themobileagentrendezvousprobleminthering
AT kranakisevangelos mobileagentrendezvousprobleminthering
AT krizancdanny mobileagentrendezvousprobleminthering
AT marcoueuripides mobileagentrendezvousprobleminthering

Ejemplares similares