Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    almahu_9949972605502882
    Umfang: XI, 271 p. , online resource.
    Ausgabe: 1st ed. 2005.
    ISBN: 9783540319962
    Serie: Theoretical Computer Science and General Issues, 3448
    Anmerkung: An External Partial Permutations Memory for Ant Colony Optimization -- A Novel Application of Evolutionary Computing in Process Systems Engineering -- Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework -- An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem -- EvoGeneS, a New Evolutionary Approach to Graph Generation -- On the Application of Evolutionary Algorithms to the Consensus Tree Problem -- Analyzing Fitness Landscapes for the Optimal Golomb Ruler Problem -- Immune Algorithms with Aging Operators for the String Folding Problem and the Protein Folding Problem -- Multiobjective Quadratic Assignment Problem Solved by an Explicit Building Block Search Algorithm - MOMGA-IIa -- Lot-Sizing in a Foundry Using Genetic Algorithm and Repair Functions -- Estimation of Distribution Algorithms with Mutation -- Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution -- Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring -- Application of the Grouping Genetic Algorithm to University Course Timetabling -- Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems -- Population Training Heuristics -- Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem -- The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem -- Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator -- Ant Algorithm for the Graph Matching Problem -- An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem -- An Improved Simulated Annealing Method for the Combinatorial Sub-problem of the Profit-Based Unit Commitment Problem -- A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem -- An AgentModel for Binary Constraint Satisfaction Problems.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783540253372
    Weitere Ausg.: Printed edition: ISBN 9783540809142
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz