Magnificent Marvel Supersale
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    Lists | March 2, 2015

    Anna Lyndsey: IMG My Top 10 Talking Books



    I have always been a reader, but eight years ago, strange circumstances conspired to make me totally book-dependent. I was stuck within four walls,... Continue »

    spacer
Qualifying orders ship free.
$45.00
New Hardcover
Ships in 1 to 3 days
Add to Wishlist
Qty Store Section
1 Burnside Software Engineering- Algorithms

Other titles in the Bradford Books series:

Ant Colony Optimization

by

Ant Colony Optimization Cover

 

Synopses & Reviews

Publisher Comments:

andlt;Pandgt;The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.andlt;/Pandgt;

Synopsis:

An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications.

Synopsis:

andlt;Pandgt;An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications.andlt;/Pandgt;

Synopsis:

The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.

Synopsis:

The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.

About the Author

Marco Dorigo is research director of the IRIDIA lab at the Université Libre de Bruxelles and the inventor of the Ant Colony Optimization metaheuristic for combinatorial optimization problems.Thomas Stützle is Assistant Professor in the Computer Science Department at Darmstadt University of Technology.

Product Details

ISBN:
9780262042192
Author:
Dorigo, Marco
Publisher:
Bradford Book
Author:
252
Author:
tzle, Thomas
Author:
&
Author:
Stutzle, Thomas
Author:
St
Author:
St�tzle, Thomas
Author:
U
Author:
Sttzle, Thomas
Location:
Cambridge, Mass.
Subject:
Ants
Subject:
Mathematical optimization
Subject:
Probability & Statistics - General
Subject:
Computer Science
Subject:
Mathematics | Probability and Statistics
Copyright:
Edition Description:
Includes bibliographical references (p. ).
Series:
Ant Colony Optimization
Series Volume:
v. 49
Publication Date:
20040631
Binding:
HARDCOVER
Grade Level:
from 17
Language:
English
Illustrations:
72 illus.
Pages:
319
Dimensions:
9 x 7 in

Other books you might like

  1. London Mathematical Society Lecture... New Trade Paper $67.25
  2. Primality Testing in Polynomial... New Trade Paper $61.25
  3. Computational Complexity Used Hardcover $120.00
  4. Universitext: Modern Geometry with... Used Trade Paper $49.00

Related Subjects

Arts and Entertainment » Music » Instruments » Strings
Computers and Internet » Software Engineering » Algorithms
History and Social Science » Economics » General
Science and Mathematics » Mathematics » Probability and Statistics » General
Science and Mathematics » Mathematics » Probability and Statistics » Statistics
Science and Mathematics » Mathematics » Reference

Ant Colony Optimization New Hardcover
0 stars - 0 reviews
$45.00 In Stock
Product details 319 pages Bradford Book - English 9780262042192 Reviews:
"Synopsis" by , An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications.
"Synopsis" by , andlt;Pandgt;An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications.andlt;/Pandgt;
"Synopsis" by , The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.
"Synopsis" by , The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.