Performance Analysis of Searching Algorithms

Mohamed Eshtawie

ISBN 10: 3346511251 / ISBN 13: 9783346511256

Editore: GRIN Verlag, 2021

Riguardo questo articolo

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.

Codice articolo 9783346511256

Dati bibliografici

• Titolo: Performance Analysis of Searching Algorithms
• Editore: GRIN Verlag
• Data di pubblicazione: 2021
• Lingua: Inglese
• ISBN 10: 3346511251
• ISBN 13: 9783346511256
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 210 L x 148 A x 2 P (millimetri) 210 millimetri di larghezza per 148 millimetri di altezza per 2 millimetri di profondità
• Peso: 45 grammi

Descrizione articolo

Riassunto

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.