{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":29,"n_cols":5,"rows_kept":29,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465421703316"]
[null,null,"Titolo",null,"Ant Colony Optimization and Swarm Intelligence [[electronic resource] ] : 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5-8, 2004, Proceeding / / edited by Marco Dorigo, Mauro Birattari, Christian Blum, Luca M. Gambardella, Francesco Mondada, Thomas Stützle"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004"]
[null,null,"ISBN",null,"3-540-28646-2"]
[null,null,"Edizione",null,"[1st ed. 2004.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 438 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 3172"]
[null,null,"Disciplina",null,"519.6"]
[null,null,"Soggetti",null,"Mathematical optimization"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Optimization"]
[{"$nulls":4},"Computer Science, general"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Computation by Abstract Devices"]
[{"$nulls":4},"Numeric Computing"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"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 -- "]
[{"$nulls":4},"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 of Ant 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."]
[null,null,null,"Sommario/riassunto","1 With its fourth edition, the ANTS series of workshops has changed its name. The original“ANTS–From Ant Colonies to Artificial Ants: International Workshop on Ant Algorithms” has become “ANTS – International Workshop on Ant Colony Optimization and Swarm Intelligence”. This change is mainly due to the following reasons. First, the term “ant algorithms” was slower in spreading in the research community than the term “swarm intelligence”, while at the same time research inso-called swarm robotics was the subject of increasing activity: it was therefore an obvious choice to substitute the term ant algorithms with the more accepted and used term swarm intelligence. Second, although swarm intelligence research has undoubtedly produced a 2 number of interesting and promising research directions , we think it is fair to say that its most successful strand is the one known as “ant colony optimization”.Ant colony optimization, first introduced in the early 1990s as a novel tool for the approximate solution of discrete optimization problems,has recently seen an explosion in the number of its applications, both to academic and real-"]
[{"$nulls":4},"world problems, and is currently being extended to the realm of continuous optimization (a few papers on this subject being published in these proceedings). It is therefore a reasonable choice to have the term ant colony optimization as part of the workshop name."]