Sirvi Märksõna "algoritm" järgi

Nüüd näidatakse 1 - 3 3

listelement.badge.access-status Avatud juurdepääs ,
Agrawali, Kayali ja Saxena teoreem algarvulisuse kohta
(Tartu Ülikool, 2013) Räni, Ave; Laan, Valdis, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
This bachelor’s thesis gives an overview about prime numbers and different methods how to determine if an integer is prime or composite. It is based on Andrew Granville’s article "It is easy to determine if a given integer is prime", where he introduces and gives a proof of the primality theorem of Agrawal, Kayal and Saxena. The theorem was first published in 2002 in a paper "PRIMES is in P" by Manindra Agrawal, Neeraj Kayal and Nitin Saxena. This thesis consists of 3 parts. In the first part, the main definitions are given that are used throughout the whole thesis. The second part gives some examples about different theorems which have been used to determine primality before the theorem of Agrawal, Kayal and Saxena. In the third part we give a detailed proof of the main theorem of the thesis. It is formulated as follows. For a given integer n 2, let r be a positive integer < n, for which n has order > (log2 n)2 (mod r). Then n is prime if and only if 1) n is not a perfect power, 2) n does not have any prime factor r, 3) (x + a)n xn + a mod (n; xr =< 1) for each integer a, 1 a p r log n. Based on this theorem M. Agrawal, N. Kayal and N. Saxena created a deterministic primality-proving algorithm. This algorithm determines whether a positive integer n is prime or composite within polynomial time with respect to the number of digits of n.
listelement.badge.access-status Avatud juurdepääs ,
Fiery semantilise segmentatsiooni mudeli efektiivsuse hindamine
(Tartu Ülikool, 2024) Möls, Ilmar; Kängsepp, Markus, juhendaja; Tartu Ülikool. Loodus- ja täppisteaduste valdkond; Tartu Ülikool. Arvutiteaduse instituut
This Bachelor's thesis focuses on analysing the performance of the Fiery model in detecting people from frontal camera images of a self-driving car using the Fiery model. The accuracy of the perception system of self-driving cars is critical, as it helps to ensure both road safety in traffic with such vehicles and the efficient operation of the vehicle's control system. The thesis covers what the Fiery model is and what is the ability of this model to identify people in the case of different persons or conditions affecting the image. In addition, the paper provides an overview of the scientific background related to self-driving cars, including the safety issues associated with autonomous vehicles and the positioning techniques used. In conclusion, the Fiery model seems to have detection problems with pedestrians on the edges of images and pedestrians lying on the road.
listelement.badge.access-status Avatud juurdepääs ,
Time Complexity of Generating Solvable Boards for Minesweeper
(Tartu Ülikool, 2025) Papagoi, Virmo; Põder, Ahti, juhendaja; Tartu Ülikool. Loodus- ja täppisteaduste valdkond; Tartu Ülikool. Arvutiteaduse instituut
This Bachelor’s thesis aimed to determine the time complexity of generating solvable boards for the game Minesweeper. This included implementing Minesweeper in Java to test the time complexity. During this thesis, explanations of solving algorithms for Minesweeper are given, and how these were modified for use in this project. Ideas for board generation algorithms are also discussed, and the generation algorithm used is explained. A hypothesis of Θ(nc^n), where c>1 is a constant that depends on mine density, and time complexity is proposed and shown to fit experimental data.