Best-first search as the simplification of weighted process algebra extension
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 m...
Saved in:
Main Author: | Arellano, Rene C. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1994
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/1607 https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=8445&context=etd_masteral |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Best-first search as the simplification of weighted process algebra extension
by: Arellano, Rene C.
Published: (1994) -
Best-first search as the simplification of weighted process algebra extension.
by: Arellano, Rene C.
Published: (1994) -
Heuristic task assignment algorithm using process algebra
by: Fernandez, Kai Shan L.
Published: (1995) -
An application of an M-tour traveling salesman algorithm (savings-based method) to Chic Centre Corporation
by: Guillermo, Dominador R., et al.
Published: (1989) -
Solutions to some diophantine equations adapted to a computer program
by: Lacanilao, Connie A., et al.
Published: (1993)