Vor Ort
Merkzettel Warenkorb
Produktbild: Optimization Techniques for Solving Complex Problems

Optimization Techniques for Solving Complex Problems

Aus der Reihe Wiley Series on Parallel and Distributed Computing

201,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

01.03.2009

Herausgeber

Enrique Alba + weitere

Verlag

John Wiley & Sons

Seitenzahl

500

Maße (L/B/H)

24/16,1/3,1 cm

Gewicht

915 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-0-470-29332-4

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

01.03.2009

Herausgeber

Verlag

John Wiley & Sons

Seitenzahl

500

Maße (L/B/H)

24/16,1/3,1 cm

Gewicht

915 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-0-470-29332-4

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
Die Leseprobe wird geladen.
  • Produktbild: Optimization Techniques for Solving Complex Problems
  • PART I: METHODOLOGIES FOR COMPLEX PROBLEM SOLVING.
     
    1. Generating Automatic Projections by Means of GP (C. Estébanez,and R. Aler).
     
    References.
     
    2. Neural Lazy Local Learning (J. M. Valls, I. M. Galván, and P. Isasi).
     
    References.
     
    3. Optimization by Using GAs with Micropopulations (Y. Sáez).
     
    References.
     
    4. Analyzing Parallel Cellular Genetic Algorithms (G. Luque, E. Alba, and B. Dorronsoro).
     
    References.
     
    5. Evaluating New Advanced Multiobjective Metaheuristics (A. J. Nebro, J.J. Durillo, F. Luna, and E. Alba).
     
    References.
     
    6. Canonical Metaheuristics for DOPs (G. Leguizamón, G. Ordóñez, S. Molina, and E. Alba).
     
    References.
     
    7. Solving Constrained Optimization Problems with HEAs (C. Cotta, and A. J. Fernández).
     
    References.
     
    8. Optimization of Time Series Using Parallel, Adaptive, and Neural Techniques (J. A. Gomez, M. D. Jaraiz, M. A. Vega, and J. M. Sanchez).
     
    References.
     
    9. Using Reconfigurable Computing to Optimization of Cryptographic Algorithms (J. M. Granado, M. A. Vega, J. M. Sanchez, and J. A. Gomez).
     
    References.
     
    10. Genetic Algorithms, Parallelism and Reconfigurable Hardware (J. M. Sanchez, M. Rubio, M. A. Vega, and J. A. Gomez).
     
    References.
     
    11. Divide and Conquer, Advanced Techniques (C. Lóon, G. Miranda, and C. Rodriguez).
     
    References.
     
    12. Tools for Tree Searches: Branch and Bound and A* Algorithms (C. León, G. Miranda, and C. Rodriguez).
     
    References.
     
    13. Tools for Tree Searches: Dynamic Programming (C. León, G. Miranda, and C. Rodriguez).
     
    Approach.
     
    References.
     
    PART II: APPLICATIONS.
     
    14. Automatic Search of Behavior Strategies in Auctions (D. Quintana, and A. Mochón).
     
    References.
     
    15. Evolving Rules For Local Time Series Prediction (C. Luque, J. M. Valls, and P. Isasi).
     
    References.
     
    16. Metaheuristics in Bioinformatics (C. Cotta, A. J. Fernández, J. E. Gallardo, G. Luque, and E. Alba).
     
    References.
     
    17. Optimal Location of Antennae in Telecommunication Networks (G. Molina, F. Chicano, and E. Alba).
     
    References.
     
    18. Optimization of Image Processing Algorithms Using FPGAs (M. A. Vega, A. Gomez, J. A. Gomez, and J. M. Sanchez).
     
    References.
     
    19. Application of Cellular Automata Algorithms to the Parallel Simulation of Laser Dynamics (J. L. Guisado, F. Jiménez Morales, J. M. Guerra, F. Fernández de Vega).
     
    References.
     
    20. Dense Stereo Disparity from an ALife Standpoint (G. Olague, F. Fernandez, C. B. Perez, and E. Lutton).
     
    References.
     
    21. Approaches to Multidimensional Knapsack Problems (J. E. Gallardo, C. Cotta, and A. J. Fernández).
     
    References.
     
    22. Greedy Seeding and ProblemSpecific Operators for GAs Solving Strip Packing Problems (C. Salto, J. M. Molina, and E. Alba).
     
    References.
     
    23. Solving the KCT Problem: Large Scale Neighborhood Search and Solution Merging (C. Blum, and M. Blesa).
     
    References.
     
    24. Experimental Study of Gabased Schedulers in Dynamic Distributed Computing Environments (F. Xhafa, and J. Carretero).
     
    References.
     
    25. ROS: Remote Optimization Service (J. GarcíaNieto, F. Chicano, and E. Alba).
     
    References.
     
    26. SIRVA, MOSET, TIDESI, ABACUS: Remote Services for Advanced.
     
    Problem Optimization (J. A. Gomez, M. A. Vega, J. M. Sanchez, J. L. Guisado, D. Lombrana, and F. Fernandez).
     
    References.
     
    Index.