• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1374
  • 382
  • 379
  • 77
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 2524
  • 1657
  • 1214
  • 1211
  • 1199
  • 458
  • 393
  • 363
  • 344
  • 344
  • 324
  • 323
  • 318
  • 308
  • 239
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
511

Conditional tests for the Hardy-Weinberg modelvwith m > 2 alleles

Ljunggren, Johan January 2022 (has links)
No description available.
512

Elliptic Curves and Cryptography

Ahlqvist, David January 2022 (has links)
No description available.
513

Neural Networks for Option Pricing

Lindqvist, Sebastian January 2022 (has links)
The task of pricing options is one with many different solutions, and overtime more complicated models of the markets have been developed in anattempt to replicate assets more accurately. In this thesis we investigate theuse of neural networks for pricing within these models. As speed is of equalconcern for option pricing, the offline training period of neural networks isa desirable property for this use. Implementing neural networks is not assimple as it may seem though and as we find out, many adaptations havebeen made to try and rectify the issues this implementation introduces. Welook more closely at methods where neural networks are used for calibrationof model parameters.
514

Quickest detection with an observation cost

Norman, William January 2022 (has links)
No description available.
515

Time series analysis of Covid-19 pandemic in Sweden

Ogumoshabe, Disan January 2022 (has links)
No description available.
516

Classifying football players using cluster analysis

Caramat Jansson, Jimmy January 2022 (has links)
This thesis attempts to apply cluster analysis to the game of football wherea set of football players were clustered into subsets based on data gatheredover a season. Two different types of clustering algorithms were used and theresults from both these methods were then looked at discussed. A couple ofmethods of choosing the number of clusters for the input in the k-means algorithmwas also compared with each other to determine a suitable number ofclusters for the data set. Looking at the result from the clustering algorithmsand also the methods of choosing the number of clusters its obvious that theused data set it homogeneous and no distinct clusters could be found (usingthe methods in the thesis). It is still possible to draw conclusions from theresult but as cluster analysis is often used initially in data exploration there isno need for a real conclusion and the result can still be interpreted differentlybased on how the result is looked at. / <p>Hade tydigare serienummer 2022:11 men det var en dublett så bytt till 2022:63.</p>
517

Wilcoxon test samt Chi-tvåtest vid ordinala data

Thomasson, Josefin January 2021 (has links)
No description available.
518

Discrete Logarithms, Integer Factorization and their role in Classical and Quantum Cryptography

Sjöberg, Emil January 2022 (has links)
No description available.
519

Ramsey's Theorem

Berggren, Leo January 2022 (has links)
No description available.
520

On Minimizing Properties of Geodesics

Perman, Zoe January 2022 (has links)
No description available.

Page generated in 0.0584 seconds