Best-first search as the simplification of weighted process algebra extension

• Main Author: Arellano, Rene C.
• Format: text
• Language: English
• Published: Animo Repository 1994
• Subjects: Heuristic programming; Algebra > Graphic methods; Programming (Mathematics); Machine theory; Computer Sciences
• Online Access: https://animorepository.dlsu.edu.ph/etd_masteral/1607; https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=8445&context=etd_masteral
• Institution: De La Salle University

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.