Search algorithms aim to find solutions or objects with specified properties and constraints in a large solution search space or among a collection of objects. A solution can be a set of value assignments to variables that will satisfy the constraints or a sub-structure of a given discrete structure. In addition, there are search algorithms, mostly probabilistic, that are designed for the prospective quantum computer. This book demonstrates the wide applicability of search algorithms for the purpose of developing useful and practical solutions to problems that arise in a variety of problem domains. Although it is targeted to a wide group of readers: researchers, graduate students, and practitioners, it does not offer an exhaustive coverage of search algorithms and applications. The chapters are organized into three parts: Population-based and quantum search algorithms, Search algorithms for image and video processing, and Search algorithms for engineering applications.

Presents research data in the study of computer search algorithms, including live soft-matter quantum computing; heuristic searches applied to the resolution of a relevant optimisation problem from the telecommunications domain; the emergence and advances of quantum search algorithms; artificial neural networks; and, more.

"Heuristic local search algorithms are used to find "good" solutions to the NP-hard combinatorial optimization problems that cannot be solved using analytical methods. Chapter one discusses the characterization and computation of heuristic local search algorithm for the Traveling Salesman Problem (TSP) from the perspective of dynamical systems. The purpose of chapter 2 is to show the practical application of CBIR technology in the security and protection of personal data, access to classified documents and objects, identification of illegal attacks that are part of the social life of the present and future of mankind. Continuous search space problems are difficult problems to solve because the number of solutions is infinite. Moreover, the search space gets more complex as we add constraints to the problem. In this context, chapter 3 aims to show the usage of the differential evolution algorithm for solving continuous search space problems using unconstrained functions and a constrained real-world problem"--

This book is particularly concerned with heuristic state-space search for combinatorial optimization. Its two central themes are the average-case complexity of state-space search algorithms and the applications of the results notably to branch-and-bound techniques. Primarily written for researchers in computer science, the author presupposes a basic familiarity with complexity theory, and it is assumed that the reader is familiar with the basic concepts of random variables and recursive functions. Two successful applications are presented in depth: one is a set of state-space transformation methods which can be used to find approximate solutions quickly, and the second is forward estimation for constructing more informative evaluation functions.

Heuristic Search is an important sub-discipline of optimization theory and finds applications in a vast variety of fields, including life science and engineering. Search methods have been useful in solving tough engineering-oriented problems that either could not be solved any other way or solutions take a very long time to be computed. This book explores a variety of applications for search methods and techniques in different fields of electrical engineering. By organizing relevant results and applications, this book will serve as a useful resource for students, researchers and practitioners to further exploit the potential of search methods in solving hard optimization problems that arise in advanced engineering technologies, such as image and video processing issues, detection and resource allocation in telecommunication systems, security and harmonic reduction in power generation systems, as well as redundancy optimization problem and search-fuzzy learning mechanisms in industrial applications.

Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed. Heuristic search as a problem solving tool is demonstrated in applications for puzzle solving, game playing, constraint satisfaction and machine learning. While no previous familiarity with heuristic search is necessary the reader should have a basic knowledge of algorithms, data structures, and calculus. Real-world case studies and chapter ending exercises help to create a full and realized picture of how search fits into the world of artificial intelligence and the one around us. - Provides real-world success stories and case studies for heuristic search algorithms - Includes many AI developments not yet covered in textbooks such as pattern databases, symbolic search, and parallel processing units

Mit diesem Buch soll aufgezeigt werden, wie von der Natur inspirierte Berechnungen eine praktische Anwendung im maschinellen Lernen finden, damit wir ein besseres Verständnis für die Welt um uns herum entwickeln. Der Schwerpunkt liegt auf der Darstellung und Präsentation aktueller Entwicklungen in den Bereichen, in denen von der Natur inspirierte Algorithmen speziell konzipiert und angewandt werden, um komplexe reale Probleme in der Datenanalyse und Mustererkennung zu lösen, und zwar durch Anwendung fachspezifischer Lösungen. Mit einer detaillierten Beschreibung verschiedener, von der Natur inspirierter Algorithmen und ihrer multidisziplinären Anwendung (beispielsweise in Maschinenbau und Elektrotechnik, beim maschinellen Lernen, in der Bildverarbeitung, beim Data Mining und in Drahtlosnetzwerken) ist dieses Buch ein praktisches Nachschlagewerk.