UCSY's Research Repository

Evaluation of Searching And Creation of B-tree And Binary Search Tree

Show simple item record

dc.contributor.author Yar, Thar
dc.contributor.author Nwe, Nwe
dc.date.accessioned 2019-08-02T04:10:57Z
dc.date.available 2019-08-02T04:10:57Z
dc.date.issued 2009-08-03
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1601
dc.description.abstract Artificial Intelligence (AI) is the computational part of the ability to achieve goal. A search algorithm, broadly speaking is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer scientists that solve problems are kinds of search algorithms. The set of all possible solutions to a problem is called the space. Otherwise known as naive or uniformed , algorithms use the simplest method of the searching through the search space , whereas informed search algorithms use heuristic functions to apply knowledge about the structure of the search space to try to reduce the amount of time spent searching’s-tree is a data structure that maintains an ordered set of data and follows efficient operations to find, delete, insert and browse the data. In this system, B-tree and Binary search tree algorithms are used for searching of Military terms and Weapons. en_US
dc.language.iso en en_US
dc.publisher Third Local Conference on Parallel and Soft Computing en_US
dc.title Evaluation of Searching And Creation of B-tree And Binary Search Tree en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account