Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$109.55
Used and New from Other Sellers
Used and New from Other Sellers
from $11.34
Usually ships in 1-2 business days
(Save 91%)
Other sellers (Hardcover)
  • All (19) from $11.34   
  • New (9) from $34.38   
  • Used (10) from $11.34   

Overview

Discover the benefits of applying algorithms to solve scientific, engineering, and practical problems

Providing a combination of theory, algorithms, and simulations, Handbook of Applied Algorithms presents an all-encompassing treatment of applying algorithms and discrete mathematics to practical problems in "hot" application areas, such as computational biology, computational chemistry, wireless networks, and computer vision.

In eighteen self-contained chapters, this timely book explores:
*

Localized algorithms that can be used in topology control for wireless ad-hoc or sensor networks
*

Bioinformatics algorithms for analyzing data
*

Clustering algorithms and identification of association rules in data mining
*

Applications of combinatorial algorithms and graph theory in chemistry and molecular biology
*

Optimizing the frequency planning of a GSM network using evolutionary algorithms
*

Algorithmic solutions and advances achieved through game theory

Complete with exercises for readers to measure their comprehension of the material presented, Handbook of Applied Algorithms is a much-needed resource for researchers, practitioners, and students within computer science, life science, and engineering.

Amiya Nayak, PhD, has over seventeen years of industrial experience and is Full Professor at the School of Information Technology and Engineering at the University of Ottawa, Canada. He is on the editorial board of several journals. Dr. Nayak's research interests are in the areas of fault tolerance, distributed systems/algorithms, and mobile ad-hoc networks. Ivan StojmenoviC?, PhD, is Professor at the University of Ottawa, Canada (www.site.uottawa.ca/~ivan), and Chair Professor of Applied Computing at the University of Birmingham, United Kingdom. Dr. Stojmenovic? received the Royal Society Wolfson Research Merit Award. His current research interests are mostly in the design and analysis of algorithms for wireless ad-hoc and sensor networks.

Read More Show Less

Product Details

  • ISBN-13: 9780470044926
  • Publisher: Wiley
  • Publication date: 1/28/2008
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 560
  • Product dimensions: 6.46 (w) x 9.41 (h) x 1.31 (d)

Meet the Author

Amiya Nayak, PHD, has over seventeen years of industrial experience and is Full Professor at the School of Information technology and Engineering at the University of Ottawa, Canada. He is on the editorial board of several journals Dr. Nayak's research interests are in the areas of fault tolerance, distributed systems/algorithms, and mobile ad-hoc networks.

Ivan Stojmenovic, PHD, is Professor at the University of Ottawa, Canada (www.site.uottawa.ca/-ivan), and Chair Professor of Applied Computing at the University of Birmingham, United Kingdom. Dr. Stojmenovic received the Royal Society Wolfson research Merit Award. His current research interests are mostly in the design and analysis of algorithms for wireless ad-hoc and sensor networks.

Read More Show Less

Table of Contents

Preface.

Abstracts.

Contributors.

1. Generating All and Random Instances of A combinatorial Object (Ivan Stojmenovic)

2. Backtracking and Isomorph-Free Generation of Polyhexes (Lucia Moura and Ivan Stojmenovic)

3. Graph Theoretic Models in Chemistry and Molecular Biology (Debra Knisley and Jeff Knisley)

4. Algorithmic Methods for the Analysis of Gene Expression Data (Hongbo Xie, Uros Midic, Slobodan Vucetic, and Zoran Obradovic)

5. Algorithms of Reaction-Diffusion Computing (Andrew Adamatzky)

6. Data  Mining Algorithms I: Clustering (Dan A. Simovici)

7. Data Mining Algorithms II: Frequent Item Sets (Dan A. Simovici)

8. Algorithms for Data Streams (Camil Demetrescu and Irene Finocchi)

9. Applying Evolutionary Algorithms to Solve the Automatic Frequency Planning Problem (Francisco Luna, Enrique Alba, Antonio J. Nero, Patrick Nauru, and Salvador Pedraza)

10. Algorithmic Game Theory and Application s(Marios Mavronicolas, Vicky Papdopoulou, and Paul Spirakis)

11. Algorithms for Real-Time Object Detection in Images (Milos Stojmenovic)

12. 2D Shape Measures for Computer Vision (Paul L. Rosin and Jovisa Zunic)

13. Cryptographic Algorithms (Binal Roy and Amiya Nayak)

14. Secure Communication in Distributed Sensor Networks (DSN) (Subhamoy Maitra and Bimal Roy)

15. Localized Topology Control Algorithms for Ad Hoc and Sensor Networks (Hannes Frey and David Simplot-Ryl)

16. A Novel Admission Control for Multimedia LEO Satellite Networks (Syed R. Rizvi, Stephan Olariu, and Mona E. Rizvi)

17. Resilient Recursive Routing in Communication Networks (Costas C. Constantinou, Alexander S. Stepanenko, Theodoros N. Arvanitis, Kevin J. Baughan, and Bin Liu)

18. Routing Algorithms on WDM Optical Networks (Qian-Ping Gu)

Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)