Artificial Intelligence, Search Methods in PROLOG
In the specialized field of Artificial Intelligence in computer science, search methods are being researched so as to find a path and/or a shortest path from a specific start node to another specified destination node within a graph/tree/network. There are a number of algorithms available for this purpose. Broadly these methods are divided into two classes: Uninformed Search and Informed search Methods. Uninformed search method includes Breadth First Search (BFS) method and Depth First Search method (DFS). Informed search method includes Hill Climbing search method, Steepest Hill Climbing search method, Best First Search method, and A* search method. PROLOG (PROgramming in LOGic) has emerged as an easy to learn tool for coding these algorithms.
1109760909
Artificial Intelligence, Search Methods in PROLOG
In the specialized field of Artificial Intelligence in computer science, search methods are being researched so as to find a path and/or a shortest path from a specific start node to another specified destination node within a graph/tree/network. There are a number of algorithms available for this purpose. Broadly these methods are divided into two classes: Uninformed Search and Informed search Methods. Uninformed search method includes Breadth First Search (BFS) method and Depth First Search method (DFS). Informed search method includes Hill Climbing search method, Steepest Hill Climbing search method, Best First Search method, and A* search method. PROLOG (PROgramming in LOGic) has emerged as an easy to learn tool for coding these algorithms.
3.99 In Stock
Artificial Intelligence, Search Methods in PROLOG

Artificial Intelligence, Search Methods in PROLOG

by Ankur Suri, R.P. Suri
Artificial Intelligence, Search Methods in PROLOG

Artificial Intelligence, Search Methods in PROLOG

by Ankur Suri, R.P. Suri

eBook

$3.99 

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers

LEND ME® See Details

Overview

In the specialized field of Artificial Intelligence in computer science, search methods are being researched so as to find a path and/or a shortest path from a specific start node to another specified destination node within a graph/tree/network. There are a number of algorithms available for this purpose. Broadly these methods are divided into two classes: Uninformed Search and Informed search Methods. Uninformed search method includes Breadth First Search (BFS) method and Depth First Search method (DFS). Informed search method includes Hill Climbing search method, Steepest Hill Climbing search method, Best First Search method, and A* search method. PROLOG (PROgramming in LOGic) has emerged as an easy to learn tool for coding these algorithms.

Product Details

BN ID: 2940014169585
Publisher: ANKUR SURI
Publication date: 03/28/2012
Sold by: Barnes & Noble
Format: eBook
File size: 349 KB
From the B&N Reads Blog

Customer Reviews