BN.com Gift Guide

Applications of Evolutionary Computation: EvoApplications 2010: EvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC, Istanbul, Turkey, April 7-9, 2010, Proceedings, Part I

Paperback (1st Edition. 2nd Printing. 3rd Printing.)
$131.68
BN.com price
(Save 22%)$169.00 List Price
Other sellers (Paperback)
  • All (9) from $107.88   
  • New (6) from $114.85   
  • Used (3) from $107.88   
Sending request ...

More About This Book

Product Details

Table of Contents

EvoCOMPLEX Contributions.- Coevolutionary Dynamics of Interacting Species.- Evolving Individual Behavior in a Multi-agent Traffic Simulator.- On Modeling and Evolutionary Optimization of Nonlinearly Coupled Pedestrian Interactions.- Revising the Trade-off between the Number of Agents and Agent Intelligence.- Sexual Recombination in Self-Organizing Interaction Networks.- Symbiogenesis as a Mechanism for Building Complex Adaptive Systems: A Review.- EvoGAMES Contributions.- Co-evolution of Optimal Agents for the Alternating Offers Bargaining Game.- Fuzzy Nash-Pareto Equilibrium: Concepts and Evolutionary Detection.- An Evolutionary Approach for Solving the Rubik’s Cube Incorporating Exact Methods.- Evolution of Artificial Terrains for Video Games Based on Accessibility.- Evolving Behaviour Trees for the Commercial Game DEFCON.- Evolving 3D Buildings for the Prototype Video Game Subversion.- Finding Better Solutions to the Mastermind Puzzle Using Evolutionary Algorithms.- Towards a Generic Framework for Automated Video Game Level Creation.- Search-Based Procedural Content Generation.- Evolution of Grim Trigger in Prisoner Dilemma Game with Partial Imitation.- Evolving a Ms. PacMan Controller Using Grammatical Evolution.- Evolving Bot AI in UnrealTM.- Evolutionary Algorithm for Generation of Entertaining Shinro Logic Puzzles.- Social Learning Algorithms Reaching Nash Equilibrium in Symmetric Cournot Games.- Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search.- EvoIASP Contributions.- A CNN Based Algorithm for the Automated Segmentation of Multiple Sclerosis Lesions.- A Hybrid Evolutionary Algorithm for Bayesian Networks Learning: An Application to Classifier Combination.- Towards Automated Learning of Object Detectors.- Markerless Multi-view Articulated Pose Estimation Using Adaptive Hierarchical Particle Swarm Optimisation.- Hand Posture Recognition Using Real-Time Artificial Evolution.- Comparing Cellular and Panmictic Genetic Algorithms for Real-Time Object Detection.- Bloat Free Genetic Programming versus Classification Trees for Identification of Burned Areas in Satellite Imagery.- Genetic Algorithms for Training Data and Polynomial Optimization in Colorimetric Characterization of Scanners.- New Genetic Operators in the Fly Algorithm: Application to Medical PET Image Reconstruction.- Chaotic Hybrid Algorithm and Its Application in Circle Detection.- Content-Based Image Retrieval of Skin Lesions by Evolutionary Feature Synthesis.- An Evolutionary Method for Model-Based Automatic Segmentation of Lower Abdomen CT Images for Radiotherapy Planning.- Evolution of Communicating Individuals.- Dynamic Data Clustering Using Stochastic Approximation Driven Multi-Dimensional Particle Swarm Optimization.- Automatic Synthesis of Associative Memories through Genetic Programming: A First Co-evolutionary Approach.- EvoINTELLIGENCE Contributions.- A Comparative Study between Genetic Algorithm and Genetic Programming Based Gait Generation Methods for Quadruped Robots.- Markerless Localization for Blind Users Using Computer Vision and Particle Swarm Optimization.- Particle Swarm Optimization for Feature Selection in Speaker Verification.- Scale- and Rotation-Robust Genetic Programming-Based Corner Detectors.- Self-organized and Evolvable Cognitive Architecture for Intelligent Agents and Multi-Agent Systems.- EvoNUM Contributions.- Investigating the Local-Meta-Model CMA-ES for Large Population Sizes.- Exploiting Evolution for an Adaptive Drift-Robust Classifier in Chemical Sensing.- Automatically Modeling Hybrid Evolutionary Algorithms from Past Executions.- Gaussian Adaptation Revisited – An Entropic View on Covariance Matrix Adaptation.- Parallel Genetic Algorithm on the CUDA Architecture.- A New Selection Ratio for Large Population Sizes.- Multi-Objective Probability Collectives.- Parallel Random Injection Differential Evolution.- Effect of Spatial Locality on an Evolutionary Algorithm for Multimodal Optimization.- A Directed Mutation Operator for Real Coded Genetic Algorithms.- Speedups between ×70 and ×120 for a Generic Local Search (Memetic) Algorithm on a Single GPGPU Chip.- Advancing Model–Building for Many–Objective Optimization Estimation of Distribution Algorithms.- Estimation Distribution Differential Evolution.- Design of Continuous Controllers Using a Multiobjective Differential Evolution Algorithm with Spherical Pruning.- Parameter Tuning of Evolutionary Algorithms: Generalist vs. Specialist.- EvoSTOC Contributions.- Memory Design for Constrained Dynamic Optimization Problems.- Multi-population Genetic Algorithms with Immigrants Scheme for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks.- Measuring Fitness Degradation in Dynamic Optimization Problems.- Handling Undefined Vectors in Expensive Optimization Problems.- Adaptive Noisy Optimization.- Noise Analysis Compact Genetic Algorithm.
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)