All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $50.71Trending at AU $61.55
- AU $32.59Trending at AU $36.88
- AU $32.77Trending at AU $40.84
- AU $30.36Trending at AU $40.12
- AU $30.37Trending at AU $31.39
- AU $15.79Trending at AU $25.15
- AU $14.47Trending at AU $16.66
About this product
- DescriptionSearch games and rendezvous problems have received growing attention in computer science within the past few years. Rendezvous problems emerge naturally, for instance, to optimize performance and convergence of mobile robots. This gives a new algorithmic point of view to the theory. Furthermore, modern topics such as the spreading of gossip or disease in social networks have lead to new challenging problems in search and rendezvous. Search Theory: A Game Theoretic Perspective introduces the first integrated approach to Search and Rendezvous from the perspectives of biologists, computer scientists and mathematicians. This contributed volume covers a wide range of topics including rendezvous problems and solutions, rendezvous on graphs, search games on biology, mobility in governed social networks, search and security, and more. Most chapters also include case studies or a survey, in addition to a chapter on the future direction of Search and Rendezvous research. This book targets researchers and practitioners working in computer science, mathematics and biology as a reference book. Advanced level students focused on these fields will also find this book valuable as a secondary text book or reference.
- PublisherSpringer-Verlag New York Inc.
- Date of Publication04/05/2013
- SubjectComputing: General
- Place of PublicationNew York, NY
- Country of PublicationUnited States
- ImprintSpringer-Verlag New York Inc.
- Content Note10 black & white tables, biography
- Weight615 g
- Width156 mm
- Height234 mm
- Spine19 mm
- Edited byLeszek Gasieniec,Robbert Fokkink,Roy Lindelauf,Steve Alpern,V. S. Subrahmanian
- Format DetailsLaminated cover
This item doesn't belong on this page.
Thanks, we'll look into this.