The Fundamentals of Search Algorithms

Main
Computers - Computer Science
The Fundamentals of Search Algorithms

The Fundamentals of Search Algorithms

Name: The Fundamentals of Search Algorithms
ISBN: 9781536192469

Robert A. Bohm (ed)

0 / 5.0

0 comments

How much do you like this book?

What’s the quality of the file?

Download the book for quality assessment

What’s the quality of the downloaded files?

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.

Categories:

Computers - Computer Science

Year:

2021

Publisher:

Nova Science Pub Inc

Language:

english

Pages:

114

ISBN 10:

1536192465