Offered as Part of the Requirements for the Master's Degree in Computer Science

Please enable javascript in your browser.

Mostakhdemin Hossini, Mahmood | 2023

0 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 57221 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Fanai, Hamid Reza
Abstract:
One of the topics that have recently been given in science and the topics of optimality have been raised and expanding in such fields, is the topic of classified algorithms. These algorithms are used to solve optimization problems, because probability bases are used in them, and some non-deterministic problems with the above can be answered to a suitable extent or a relatively optimal solution can be found for these problems. These algorithms can sometimes perform multiple solutions to the decision problems they have and generate their answers. We will examine the types of segmentation algorithms and we will get to know these algorithms to a good extent, and also we have reached the problems that we do well with these algorithms, and we want to examine these algorithms. shows that compared to the other algorithms used, which is perhaps to a large extent obvious and bad, because compared to the deterministic algorithms that perform much better and the time complexity is much better than the other algorithms. It shows. These algorithms will be used to solve indeterministic problems in the graph, such as routing
Keywords:
Segmentation ; Optimization ; Non-Deterministic Problems ; Bandit Algorithms ; Graph Algorithms ; Shortest Path

No TOC