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

• المؤلف الرئيسي: Arellano, Rene C.
• التنسيق: text
• اللغة: English
• منشور في: Animo Repository 1994
• الموضوعات: Heuristic programming; Algebra > Graphic methods; Programming (Mathematics); Machine theory; Computer Sciences
• الوصول للمادة أونلاين: https://animorepository.dlsu.edu.ph/etd_masteral/1607; https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=8445&context=etd_masteral

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...