Ant Colony Optimization and Swarm Intelligence: 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5-8, 2004, Proceeding: Lecture Notes in Computer Science, cartea 3172
Editat de Marco Dorigo, Mauro Birattari, Christian Blum, Luca M. Gambardella, Francesco Mondada, Thomas Stützleen Limba Engleză Paperback – 19 aug 2004
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 389.18 lei
Nou
Puncte Express: 584
Preț estimativ în valută:
74.48€ • 77.37$ • 61.87£
74.48€ • 77.37$ • 61.87£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540226727
ISBN-10: 3540226729
Pagini: 452
Ilustrații: XIV, 438 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.63 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540226729
Pagini: 452
Ilustrații: XIV, 438 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.63 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
A Comparison Between ACO Algorithms for the Set Covering Problem.- A Comparison Between ACO Algorithms for the Set Covering Problem.- A VLSI Multiplication-and-Add Scheme Based on Swarm Intelligence Approaches.- ACO for Continuous and Mixed-Variable Optimization.- An Ant Approach to Membership Overlay Design.- An Ant Colony Optimisation Algorithm for the Set Packing Problem.- An Empirical Analysis of Multiple Objective Ant Colony Optimization Algorithms for the Bi-criteria TSP.- An External Memory Implementation in Ant Colony Optimization.- BeeHive: An Efficient Fault-Tolerant Routing Algorithm Inspired by Honey Bee Behavior.- Competition Controlled Pheromone Update for Ant Colony Optimization.- Cooperative Transport of Objects of Different Shapes and Sizes.- Deception in Ant Colony Optimization.- Evolution of Direct Communication for a Swarm-bot Performing Hole Avoidance.- Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities.- Improvements on Ant Routing for Sensor Networks.- Integrating ACO and Constraint Propagation.- Logistic Constraints on 3D Termite Construction.- Modeling Ant Behavior Under a Variable Environment.- Multi-type Ant Colony: The Edge Disjoint Paths Problem.- On the Design of ACO for the Biobjective Quadratic Assignment Problem.- Reasons of ACO’s Success in TSP.- S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty.- Time-Scattered Heuristic for the Hardware Implementation of Population-Based ACO.- Short Papers.- Ad Hoc Networking with Swarm Intelligence.- An Ant Colony Heuristic for the Design of Two-Edge Connected Flow Networks.- An Experimental Analysis of Loop-Free Algorithms for Scale-Free Networks.- An Experimental Study of the Ant Colony System for the Period Vehicle Routing Problem.- An Extension ofAnt Colony System to Continuous Optimization Problems.- Ant Algorithms for Urban Waste Collection Routing.- Ants Can Play Music.- Backtracking Ant System for the Traveling Salesman Problem.- Colored Ants for Distributed Simulations.- Dynamic Routing in Mobile Wireless Networks Using ABC-AdHoc.- Fuzzy Ant Based Clustering.- How to Use Ants for Hierarchical Clustering.- Inversing Mechanical Parameters of Concrete Gravity Dams Using Ant Colony Optimization.- Large Pheromones: A Case Study with Multi-agent Physical A*.- Near Parameter Free Ant Colony Optimisation.- Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem.- Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation.- Task Oriented Functional Self-organization of Mobile Agents Team: Memory Optimization Based on Correlation Feature.- Towards a Real Micro Robotic Swarm.- Posters.- A Hybrid Ant Colony System Approach for the Capacitated Vehicle Routing Problem.- A Swarm-Based Approach for Selection of Signal Plans in Urban Scenarios.- Ant Colony Behaviour as Routing Mechanism to Provide Quality of Service.- Applying Ant Colony Optimization to the Capacitated Arc Routing Problem.- Dynamic Optimization Through Continuous Interacting Ant Colony.- Dynamic Routing in Traffic Networks Using AntNet.- First Competitive Ant Colony Scheme for the CARP.- Hypothesis Corroboration in Semantic Spaces with Swarming Agents.- Mesh-Partitioning with the Multiple Ant-Colony Algorithm.
Caracteristici
Includes supplementary material: sn.pub/extras