A comprehensive account of recent algorithms developed in computational number theory and primality testing. Provides a general framework for the theoretical study of public key cryptography and pseudorandom generators. Unique in its approach, the book will be a valuable addition to computer literature.
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 node of a network. Like leader election, such an operation is a useful subroutine in more general computations that may require the agents to synchronize, share information, divide up chores, etc. The work provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting. For the most part our investigation concentrates on the simplest case of two agents attempting to rendezvous on a ring network. Other situations including multiple agents, faulty nodes and other topologies are also examined. An extensive bibliography provides many pointers to related work not covered in the text. The presentation has a distinctly algorithmic, rigorous, distributed computing flavor and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments. Table of Contents: Models for Mobile Agent Computing / Deterministic Rendezvous in a Ring / Multiple Agent Rendezvous in a Ring / Randomized Rendezvous in a Ring / Other Models / Other Topologies
The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform computation models are studied in the form of Boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers.
This book constitutes the refereed proceedings of the Second International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2003, held in Montreal, Canada in October 2003. The 23 revised full papers and 4 revised short papers presented were carefully reviewed and selected from 42 submissions. All current aspects of ad-hoc networking, mobile, wireless, and cooperating communication systems are addressed including network architectures, access control and discovery, multicasting protocols, performance, quality of service, QoS, routing protocols, scalability, security, and self-configuration.
This book constitutes the refereed proceedings of the Second International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2003, held in Montreal, Canada in October 2003. The 23 revised full papers and 4 revised short papers presented were carefully reviewed and selected from 42 submissions. All current aspects of ad-hoc networking, mobile, wireless, and cooperating communication systems are addressed including network architectures, access control and discovery, multicasting protocols, performance, quality of service, QoS, routing protocols, scalability, security, and self-configuration.
This book constitutes the refereed proceedings of the 6th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2007, held in Morelia, Mexico, in September 2007. The 21 revised full papers were carefully reviewed and selected from 50 submissions. The papers are organized in topical sections on routing, topology control, security and privacy, protocols, as well as quality of service and performance.
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.