View in EDS PDF Full Text

The Fundamentals of Search Algorithms

Saved in:
Bibliographic Details
Title: The Fundamentals of Search Algorithms
Description: 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.
Authors: Robert A. Bohm
Resource Type: eBook.
Subjects: Querying (Computer science), Computer algorithms, Algorithms, Database searching
Categories: COMPUTERS / Computer Science
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 2735501
RelevancyScore: 1103
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1103.19409179688
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$2735501$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$2735501$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: The Fundamentals of Search Algorithms
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Robert+A%2E+Bohm%22">Robert A. Bohm</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Querying+%28Computer+science%29%22">Querying (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+algorithms%22">Computer algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Database+searching%22">Database searching</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Computer+Science%22">COMPUTERS / Computer Science</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=2735501
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 005.74
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Querying (Computer science)
        Type: general
      – SubjectFull: Computer algorithms
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Database searching
        Type: general
    Titles:
      – TitleFull: The Fundamentals of Search Algorithms
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Robert A. Bohm
      – PersonEntity:
          Name:
            NameFull: Robert A. Bohm
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2021
            – D: 27
              M: 02
              Type: profile
              Y: 2021
          Identifiers:
            – Type: isbn-print
              Value: 9781536190076
            – Type: isbn-electronic
              Value: 9781536192469
          Titles:
            – TitleFull: The Fundamentals of Search Algorithms
              Type: main
ResultId 1