Vi bøger
Levering: 1 - 2 hverdage
Forlænget returret til d. 31. januar 2025

Bøger i Uncertainty, Computational Techniques, and Decision Intelligence serien

Filter
Filter
Sorter efterSorter Serie rækkefølge
  • af Sahar (Operations Team Leader Tahvili & Leo (Lecturer Hatvani
    1.681,95 kr.

  • af Stanislaw (Universidad Panamericana Raczynski
    2.225,95 kr.

    Reachable Sets of Dynamic Systems: Uncertainty, Sensitivity, and Complex Dynamics introduces differential inclusions, providing an overview as well as multiple examples of its interdisciplinary applications. The design of dynamic systems of any type is an important issue as is the influence of uncertainty in model parameters and model sensitivity. The possibility of calculating the reachable sets may be a powerful additional tool in such tasks. This book can help graduate students, researchers, and engineers working in the field of computer simulation and model building, in the calculation of reachable sets of dynamic models.

  • af Farhad Hosseinzadeh Lotfi, Masoud Sanei & Ali Asghar Hosseinzadeh
    1.318,95 kr.

  • af Chun-Wei Tsai
    1.580,95 kr.

    Handbook of Metaheuristic Algorithms: From Fundamental Theories to Advanced Applications provides a brief introduction to metaheuristic algorithms from the ground up, including basic ideas and advanced solutions. Although readers may be able to find source code for some metaheuristic algorithms on the Internet, the coding styles and explanations are generally quite different, and thus requiring expanded knowledge between theory and implementation. This book can also help students and researchers construct an integrated perspective of metaheuristic and unsupervised algorithms for artificial intelligence research in computer science and applied engineering domains. Metaheuristic algorithms can be considered the epitome of unsupervised learning algorithms for the optimization of engineering and artificial intelligence problems, including simulated annealing (SA), tabu search (TS), genetic algorithm (GA), ant colony optimization (ACO), particle swarm optimization (PSO), differential evolution (DE), and others. Distinct from most supervised learning algorithms that need labeled data to learn and construct determination models, metaheuristic algorithms inherit characteristics of unsupervised learning algorithms used for solving complex engineering optimization problems without labeled data, just like self-learning, to find solutions to complex problems.

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.