Comparative Study of RBFS & ARBFS Algorithm
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 10, Issue 5
Abstract
RBFS is a best-first search that runs in space that is linear with respect to the maximum search depth, regardless of the cost function used. This algorithm allows the use of all available memory. One major flaw of this algorithm is that it can visit the same node several times. This makes the computational cost may be unaffordable for some accuracy. This problem can be much solved by using various extension of Heuristic Search. By using anytime approach in our simple RBFS will improve solution by saving the current solution & continues the search.Anytime RBFS algorithm will optimize the memory & time resources and are considered best for RBFS algorithm. When the time available to solve a search problem is limited or uncertain, this creates an anytime heuristic search algorithm that allows a flexible substitution between search time and solution quality. Some applications like Real Time Strategy (RTS) games have applied these algorithms to find a fast solution that will help the algorithm prune some paths during the subsequent computation.
Authors and Affiliations
Disha Sharma
Keywords
Related Articles
- EP ID EP161866
- DOI -
- Views 94
- Downloads 0
The Importance of Object-Oriented Programming in This Era of Mobile Application Development
Abstract: In the past two decades object oriented programming has become the dominant programming OOP paradigm used by application developers. Object oriented programming scales very well, from the most trivial of proble...
Prevention of Cheating Message based on Block Cipher using Digital Envelope
Abstract: Quick assessment of advanced information trade happens as of late. Because of that security of data is much critical in information stockpiling and transmission process. That implies there is a need to shield t...
Comparative Performance Analysis of SALT and PEPPER Noise Removal
Abstract: Noise is an important factor which when get added to an image reduces its quality and appearance.So in order to enhance the image qualities, it has to be removed with preserving the textural information a...
A new approach for user identification in web usage mining preprocessing
Web usage mining is a subset of data mining. In order to huge amount of data but the data is less appropriates “quantity and quality” of the web data is opposite to each other this is the main problem. Web ...
Limitations of Network Security for Enabling Application Access