A Modification Of The Dynamic Programming Search With Heuristic Information.

Date of Submission

December 1988

Date of Award

Winter 12-12-1989

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Electronics and Communication Sciences Unit (ECSU-Kolkata)


Ray, Kumar Sankar (ECSU-Kolkata; ISI)

Abstract (Summary of the Work)

The problem of finding an optimal solution from a large sat of feasible solution has always been a difficult and tricky program to solve. Most problem of real life interest have large number of feasible solution which usually increase in problem size. Various methods have been developed to tackle the situation. The methods covered in this study arei) Dynamic Programming Searchii) A* SearchEvery search process can be viewed as a traversar of a directed graph in which each node represents a problem state and each are represents a relationship between the states represented by the nodes it connects. The search process must find a path through the graph, starting at an initial state and ending in one or more final states.The object of a search procedure is to discover a path from initial state to a goal state. There are two directions in which a search could proceed - Forward, from the start state. Backward, from the goal states.


ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843124

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.



This document is currently not available here.