Mobile Peer-to-Peer Computing for Next Generation Distributed Environments | Advancing Conceptual and Algorithmic Applications

Boon-Chong Seet

ISBN 10: 1605667153 / ISBN 13: 9781605667157

Published by Information Science Reference, 2011

About this Item

Mobile Peer-to-Peer Computing for Next Generation Distributed Environments | Advancing Conceptual and Algorithmic Applications | Boon-Chong Seet | Buch | Gebunden | Englisch | 2011 | Information Science Reference | EAN 9781605667157 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 101647378

Bibliographic Details

• Title: Mobile Peer-to-Peer Computing for Next Generation Distributed Environments | Advancing Conceptual and Algorithmic Applications
• Publisher: Information Science Reference
• Publication Date: 2011
• Language: English
• ISBN 10: 1605667153
• ISBN 13: 9781605667157
• Binding: Buch
• Condition: Neu
• Dimensions: 286W x 221H x 35D millimeters 286 millimeters width by 221 millimeters height by 35 millimeters depth
• Weight: 1656 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

Peer-to-peer computing has gained significant attention from both industry and research communities in the past decade as the number of users worldwide continues to grow along with demand for mobile computing. Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications focuses on current research and innovation in mobile and wireless technologies that address challenges from both a theoretical and applied perspective. This advanced publication provides researchers, practitioners, and academicians with an authoritative reference source to the latest state-of-the-art developments in this growing technology field.

About the Author

###############################################################################################################################################################################################################################################################