Performance Analysis of Searching Algorithms

Mohamed Eshtawie

ISBN 10: 3346511251 / ISBN 13: 9783346511256

Published by GRIN Verlag, 2021

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783346511256

Bibliographic Details

• Title: Performance Analysis of Searching Algorithms
• Publisher: GRIN Verlag
• Publication Date: 2021
• Language: English
• ISBN 10: 3346511251
• ISBN 13: 9783346511256
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 210W x 148H x 2D millimeters 210 millimeters width by 148 millimeters height by 2 millimeters depth
• Weight: 45 grams

About this title

Synopsis

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.