Date of Publication

9-1994

Document Type

Master's Thesis

Degree Name

Master of Science in Computer Science

Subject Categories

Computer Sciences

College

College of Computer Studies

Department/Unit

Computer Science

Thesis Adviser

Arnulfo P. Azcarraga

Defense Panel Chair

Kelsey Hartigan Go

Defense Panel Member

Philip Chan
Raymund Sison

Abstract/Summary

In the course of searching for ways of making the computer think like a human being, scientists have developed a number of search techniques that can be implemented in order to find a solution to a particular problem. Examples of such search methods are breadth-first search, depth-first search. To make such techniques more efficient, heuristic search methods were developed. The most prominent of these techniques is the best-first search. Process algebra is an algebraic tool for modelling processes in a formal definition. It can be used in a number of different applications, most of which is on concurrency. This paper aims to apply the axioms and elements defined in Process Algebra in coming up with a formalism for the best-first search technique.

Abstract Format

html

Language

English

Format

Print

Accession Number

TG02315

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

50 leaves, 28 cm.

Keywords

Heuristic programming; Algebra--Graphic methods; Programming (Mathematics); Machine theory

Upload Full Text

wf_yes

Download

Share

COinS