rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Search in Artificial Intelligence
  name:
    name part: Kanal, Laveen.
    role:
      role term: creator
  name:
    name part: Kumar, Vipin.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: Electronic books.
  origin info:
    place:
      place term: nyu
    date issued: 1988
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: access
    form: remote
    extent: 1 online resource (x, 482 pages 67 illustrations)
  abstract: This book brings together some new insights and recent developments on the topics of search procedures in Artificial Intelligence and the relationships among search methods in Artificial Intelligence, Operations Research, and Engineering. The purpose of the book is to present these new insights and recent developments in a manner accessible to students and professionals in Computer Science, Engineering, Operations Research, and Applied Mathematics. The articles should provide the reader with a broad view of recent developments on search in AI and some of the relationships among branch and bound, heuristic search, and dynamic programming. New models for discrete optimization problems, new results on the average case of complexity of the well known A* algorithm, new results on the conditions under which A* is optimal over other search algorithms, use of different sources of knowledge in heuristic search, new results on the constraint satisfaction problem, and a result showing the minimax back up rule does not do as well as the product rule in some real games.
  table of contents: The CDP: A Unifying Formulation for Heuristic Search, Dynamic Programming, and Branch-and-Bound -- An Algebra for Search Problems and Their Solutions -- A General Branch-and-Bound Formulation for AND/OR Graph and Game Tree Search -- Average-Case Analysis of Heuristic Search in Tree-Like Networks -- The Optimality of A* -- Network Search Algorithms with Modifiable Heuristics -- Optimal Path Finding Algorithms -- Developments with GPS -- Tree Search and Arc Consistency in Constraint Satisfaction Algorithms -- Backtrack-Free and Backtrack-Bounded Search -- Network-Based Heuristics for Constraint-Satisfaction Problems -- Fundamental Properties of Networks of Constraints: A New Formulation -- Comparison of the MINIMAX and PRODUCT Back-Up Rules in a Variety of Games -- Index.
  note: edited by Laveen Kanal, Vipin Kumar.
  note: Electronic resource.
  subject:
    topic: Computer science
  subject:
    topic: Artificial intelligence
  subject:
    topic: Artificial intelligence
  subject:
    topic: Computer science
  classification: Q334-342
  classification: TJ210.2-211.495
  classification: 006.3
  related item:
    title info:
      title: Symbolic computation
      part name: Artificial intelligence
  identifier: 9781461387886 (electronic bk.)
  identifier: 1461387884 (electronic bk.)
  identifier: 9781461387909
  identifier: 1461387906
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: AU@
    record creation date: 121227
    record change date: 20260422160046.8
    record identifier: in00003570497
    language of cataloging:
      language term: eng