Performance Analysis of Searching Algorithms

By Mohamed Eshtawie

Academic Paper from the year 2021 in the subject Computer Science - Applied, language: English, abstract: Problem-solving is an essential topic in Artificial Intelligence study and application. It is concerned with solving mathematical problems and clues such as puzzles. This study is primarily concerned with the ability of some searching algorithms such as Restricted Boltzmann Machines, Message Passing, Breadth First Search and Depth First Search to Solve Sudoku puzzle problems in the area of AI. For each of these methods, a code in Java language will be written and executed so that performance analysis can take place. A comparison analysis between the selected algorithms will be done. The analysis will cover some parameters such as time, space, optimality, completeness.

• Format: Paperback
• Language: English
• ISBN: 3346511251
• ISBN13: 9783346511256
• Release Date: November 2021
• Publisher: Grin Verlag
• Length: 20 Pages
• Weight: 0.09 lbs.
• Dimensions: 0.1" x 5.8" x 8.3"