Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series)
$48.39 / copy at 25+ copies As low as $47.29 at 100+Your best volume price
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Built for school and campus orders
PDF quotes, purchase orders, tax exemption and multi-site delivery, handled by one account manager.
PDF quotes, purchase orders, tax exemption and help with vendor setup.
For schools Make it yoursBookplates, tipped-in pages, belly bands or author signatures. Hardcovers only, subject to publisher approval.
Customization options Ship to every readerOne address, many sites or individual recipients' homes, in the US and abroad.
Fulfillment optionsSpatially Structured Evolutionary Algorithms
Evolutionary algorithms (EAs) is now a mature problem-solving family of heuristics that has found its way into many important real-life problems and into leading-edge scientific research. Spatially structured EAs have different properties than standard, mixing EAs. By virtue of the structured disposition of the population members they bring about new dynamical features that can be harnessed to solve difficult problems faster and more efficiently. This book describes the state of the art in spatially structured EAs by using graph concepts as a unifying theme. The models, their analysis, and their empirical behavior are presented in detail. Moreover, there is new material on non-standard networked population structures such as small-world networks.
The book should be of interest to advanced undergraduate and graduate students working in evolutionary computation, machine learning, and optimization. It should also be useful to researchers and professionals working in fields where the topological structures of populations and their evolution plays a role.
The book, Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series) [Bulk, Wholesale, Quantity] ISBN#9783540241935 in Hardcover by Marco Tomassini may be ordered in bulk quantities. Minimum starts at 25 copies. Availability based on publisher status and quantity being ordered.
Details
- Publisher
- Springer Berlin Heidelberg
- Author
- Marco Tomassini
- Format
- Hardcover
- Published
- Sep 27, 2005
- ISBN-13
- 9783540241935
- Pages
- 193
Spatially Structured Evolutionary Algorithms in bulk: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $48.39 | 12% off list |
| 50 – 99 | $47.84 | 13% off list |
| 100+ | $47.29 | 14% off list |
Popular for
A copy for every student in the class or section.
Shared reading for professional development.
Common reads and first-year programs.
How fast can I get copies of Spatially Structured Evolutionary Algorithms?
Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship in bulk to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other bulk booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
Write a Review
Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series)
Groups also order
A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.