Ramdan Hours:
Sun - Thu
9.30 AM - 2.30 PM
Iftar in --:--:--
🌙 Maghrib: --:--
Image from Google Jackets

Artificial intelligence By Ravi Bhushan Mishra.

By: Material type: TextTextSeries: Academic Press series in cognition and perceptionPublisher: New Delhi : Ohl Learning, 2011Description: xii, 503 pages ; illustration : 24 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 0123623405
Subject(s): DDC classification:
  • 001.535 22 M.R.A
LOC classification:
  • Q335 .H79 1975
Online resources:
Contents:
Front Cover; Artificial Intelligence; Copyright Page; Table of Contents; PREFACE; ACKNOWLEDGMENTS; Part I: Introduction; Chapter I. THE SCOPE OF ARTIFICIAL INTELLIGENCE; 1.0 IS THERE SUCH A THING?; 1.1 Problem Solving; 1.2 Pattern Recognition; 1.3 Game Playing and Decision Making; 1.4 Natural Language and Machine Comprehension; 1.5 Self-Organizing Systems; 1.6 Robotology; Chapter II. PROGRAMMING, PROGRAM STRUCTURE, AND COMPUTABILITY; 2.0 The Relevance of Computability; 2.1 Computations on Strings; 2.2 Formal Grammars; 2.3 Turing Machines; 2.4 Linear Bounded Automata and Type 1 Languages. 2.5 Pushdown Automata and Type 2 Languages2.6 Finite Automata and Regular (Type 3) Languages; 2.7 Summary and Comments on Practicality; Part II: Pattern Recognition; Chapter III. GENERAL CONSIDERATIONS IN PATTERN RECOGNITION; 3.0 Classification; 3.1 Categorizing Pattern-Recognition Problems; 3.2 Historical Perspective and Current Issues; Chapter IV. PATTERN CLASSIFICATION AND RECOGNITION METHODS BASED ON EUCLIDEAN DESCRIPTION SPACES; 4.0 General; 4.1 . Bayesian Procedures in Pattern Recognition; 4.2 Classic Statistical Approach to Pattern Recognition and Classification. 4.3 Classification Based on Proximity of Descriptions4.4 Learning Algorithms; 4.5 Clustering; Chapter V. NON-EUCLIDEAN PARALLEL PROCEDURES: THE PERCEPTRON; 5.0 Introduction and Historical Comment; 5.1 Terminology; 5.2 Basic Theorems for Order-Limited Perceptrons; 5.3 Substantive Theorems for Order-Limited Perceptrons; 5.4
Capabilities of Diameter-Limited Perceptrons; 5.5 The Importance of Perceptron Analysis; Chapter VI. SEQUENTIAL PATTERN RECOGNITION; 6.0 Sequential Classification; 6.1 Definitions and Notation; 6.2 Bayesian Decision Procedures. 6.3 Bayesian Optimal Classification Procedures Based on Dynamic Programming6.4 Approximations Based on Limited Look Ahead Algorithms; 6.5 Convergence in Sequential Pattern Recognition; Chapter VII. GRAMMATICAL PATTERN CLASSIFICATION; 7.0 The Linguistic Approach to Pattern Analysis; 7.1 The Grammatical Inference Problem; 7.2 Grammatical Analysis Applied to Two-Dimensional Images; Chapter VIII. FEATURE EXTRACTION; 8.0 General; 8.1 Formalization of the Factor-Analytic Approach; 8.2 Formalization of the Binary Measurement Case; 8.3 Constructive Heuristics for Feature Detection. 8.4 An Experimental Study of Feature Generation in Pattern Recognition8.5 On Being Clever; Part III: Theorem Proving and Problem Solving; Chapter IX. COMPUTER MANIPULABLE REPRESENTATIONS IN PROBLEM SOLVING; 9.0 The Use of Representations; 9.1 A Typology of Representations; 9.2 Combining Representations; Chapter X. GRAPHIC REPRESENTATIONS IN PROBLEM SOLVING; 10.0 Basic Concepts and Definitions; 10.1 Algorithms for Finding a Minimal Path to a Single Goal Node; 10.2 An ""Optimal"" Ordered Search Algorithm; 10.3 Tree Graphs and Their Use; Chapter XI. HEURISTIC PROBLEM-SOLVING PROGRAMS.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode
Books Books Main library A1 Computers & Information Technology ( Computer Science ) 001.535 M.R.A (Browse shelf(Opens below)) Available 00009252

Bibliography: p. [446]-457.

Front Cover; Artificial Intelligence; Copyright Page; Table of Contents; PREFACE; ACKNOWLEDGMENTS; Part I: Introduction; Chapter I. THE SCOPE OF ARTIFICIAL INTELLIGENCE; 1.0 IS THERE SUCH A THING?; 1.1 Problem Solving; 1.2 Pattern Recognition; 1.3 Game Playing and Decision Making; 1.4 Natural Language and Machine Comprehension; 1.5 Self-Organizing Systems; 1.6 Robotology; Chapter II. PROGRAMMING, PROGRAM STRUCTURE, AND COMPUTABILITY; 2.0 The Relevance of Computability; 2.1 Computations on Strings; 2.2 Formal Grammars; 2.3 Turing Machines; 2.4 Linear Bounded Automata and Type 1 Languages. 2.5 Pushdown Automata and Type 2 Languages2.6 Finite Automata and Regular (Type 3) Languages; 2.7 Summary and Comments on Practicality; Part II: Pattern Recognition; Chapter III. GENERAL CONSIDERATIONS IN PATTERN RECOGNITION; 3.0 Classification; 3.1 Categorizing Pattern-Recognition Problems; 3.2 Historical Perspective and Current Issues; Chapter IV. PATTERN CLASSIFICATION AND RECOGNITION METHODS BASED ON EUCLIDEAN DESCRIPTION SPACES; 4.0 General; 4.1 . Bayesian Procedures in Pattern Recognition; 4.2 Classic Statistical Approach to Pattern Recognition and Classification. 4.3 Classification Based on Proximity of Descriptions4.4 Learning Algorithms; 4.5 Clustering; Chapter V. NON-EUCLIDEAN PARALLEL PROCEDURES: THE PERCEPTRON; 5.0 Introduction and Historical Comment; 5.1 Terminology; 5.2 Basic Theorems for Order-Limited Perceptrons; 5.3 Substantive Theorems for Order-Limited Perceptrons; 5.4

Capabilities of Diameter-Limited Perceptrons; 5.5 The Importance of Perceptron Analysis; Chapter VI. SEQUENTIAL PATTERN RECOGNITION; 6.0 Sequential Classification; 6.1 Definitions and Notation; 6.2 Bayesian Decision Procedures. 6.3 Bayesian Optimal Classification Procedures Based on Dynamic Programming6.4 Approximations Based on Limited Look Ahead Algorithms; 6.5 Convergence in Sequential Pattern Recognition; Chapter VII. GRAMMATICAL PATTERN CLASSIFICATION; 7.0 The Linguistic Approach to Pattern Analysis; 7.1 The Grammatical Inference Problem; 7.2 Grammatical Analysis Applied to Two-Dimensional Images; Chapter VIII. FEATURE EXTRACTION; 8.0 General; 8.1 Formalization of the Factor-Analytic Approach; 8.2 Formalization of the Binary Measurement Case; 8.3 Constructive Heuristics for Feature Detection. 8.4 An Experimental Study of Feature Generation in Pattern Recognition8.5 On Being Clever; Part III: Theorem Proving and Problem Solving; Chapter IX. COMPUTER MANIPULABLE REPRESENTATIONS IN PROBLEM SOLVING; 9.0 The Use of Representations; 9.1 A Typology of Representations; 9.2 Combining Representations; Chapter X. GRAPHIC REPRESENTATIONS IN PROBLEM SOLVING; 10.0 Basic Concepts and Definitions; 10.1 Algorithms for Finding a Minimal Path to a Single Goal Node; 10.2 An ""Optimal"" Ordered Search Algorithm; 10.3 Tree Graphs and Their Use; Chapter XI. HEURISTIC PROBLEM-SOLVING PROGRAMS.

There are no comments on this title.

to post a comment.