Poslední příspěvky

Zobrazují se záznamy 81-90 z 11342

  • Immersive VR Tutorial Application for Omnidirectional Treadmill: Design, Implementation, and Testing 

    Výsledek obhajoby: OBHÁJENO
    Suchardová, Eliška (Univerzita Karlova, Matematicko-fyzikální fakulta, 2025)
    Datum obhajoby: 11. 2. 2025
    With immersive virtual reality gaining popularity, the need for effective locomotion solutions grows. Omnidirectional treadmills present a promising solution; however, their novelty poses a considerable challenge. A ...
  • Development of a Web-based Framework for Visualizing Biological Neural Network Simulations 

    Výsledek obhajoby: OBHÁJENO
    Horváth, Norbert (Univerzita Karlova, Matematicko-fyzikální fakulta, 2025)
    Datum obhajoby: 10. 2. 2025
    Modern neuroscience increasingly relies on simulations of biological neural networks to unravel the complexities of how our brains work. Mozaik is a framework offering a platform for conducting small and large-scale neural ...
  • Artificial Intelligence techniques for searching paths and cycles in hypercubes 

    Výsledek obhajoby: OBHÁJENO
    Hotmar, Vojtěch (Univerzita Karlova, Matematicko-fyzikální fakulta, 2025)
    Datum obhajoby: 4. 2. 2025
    In this thesis we study Hamilton paths and cycles in hypercubes. We prove that any matching spanning at most five directions in an n-dimensional hypercube can be extended to a Hamilton cycle, and characterize when such ...
  • Schwarz methods 

    Výsledek obhajoby: OBHÁJENO
    Dostál, David (Univerzita Karlova, Matematicko-fyzikální fakulta, 2024)
    Datum obhajoby: 12. 9. 2024
    Schwarz methods are numerical methods for solving partial differential equati- ons, based on domain decomposition dividing the original large problem into smaller sub-problems. The problem corresponding to each subdomain ...
  • Návrh frameworku pro edge-cloud continuum 

    Výsledek obhajoby: NEOBHÁJENO
    Lamplot, Milan (Univerzita Karlova, Matematicko-fyzikální fakulta, 2024)
    Datum obhajoby: 5. 9. 2024
    The aim of this work is to design and implement a framework for Edge-Cloud Con- tinuum (ECC) in Java. Nowadays, there is an increasing number of Internet of Things (IoT) devices and the data that these devices generate. ...
  • Distorční míry rizika ve vícekriteriálních úlohách optimalizace portfolia 

    Výsledek obhajoby: OBHÁJENO
    Celý dokument nebo jeho části jsou nepřístupné do 05. 02. 2028
    Hájková, Eliška (Univerzita Karlova, Matematicko-fyzikální fakulta, 2025)
    Datum obhajoby: 4. 2. 2025
    The thesis focuses on distortion risk measures, examples of distortion risk measures, their properties, their relationship with spectral risk measures, and their application in portfolio optimization. The subject of the ...
  • Implicitní QR algoritmus s násobnými shifty 

    Výsledek obhajoby: OBHÁJENO
    Cirbus, Jan (Univerzita Karlova, Matematicko-fyzikální fakulta, 2025)
    Datum obhajoby: 6. 2. 2025
    In this paper, we will focus on finding the eigenvalues of complex square matrices. For this purpose, we will derive in detail the implicit QR algorithm with multiple shifts. In the derivation, we will acquaint ourselves ...
  • Well-posed optimization problems 

    Výsledek obhajoby: OBHÁJENO
    Šmaňko, Bohdan (Univerzita Karlova, Matematicko-fyzikální fakulta, 2025)
    Datum obhajoby: 5. 2. 2025
    We study the relations between different notions of well-posed optimization problems, with focus on the well-posedness of minimization problems in metric spaces. We begin by introducing the concepts of Tikhonov, Levitin-Polyak, ...
  • Fully symmetric operations 

    Výsledek obhajoby: OBHÁJENO
    Kubica, Jan (Univerzita Karlova, Matematicko-fyzikální fakulta, 2025)
    Datum obhajoby: 5. 2. 2025
    The Constraint Satisfaction Problem over an algebra A is solvable by the basic linear programming relaxation if, and only if, A has a symmetric term operation of every arity. It is, however, unclear how to decide that the ...
  • Linear programming and Artificial Intelligence for Vehicle scheduling problems 

    Výsledek obhajoby: OBHÁJENO
    Tyle, Tomáš (Univerzita Karlova, Matematicko-fyzikální fakulta, 2025)
    Datum obhajoby: 4. 2. 2025
    This work utilises machine learning methods in the branch and price algorithm and applies it to the crew and vehicle scheduling problem. Using machine learning, statistical models are taught to select variables for branching. ...

© 2025 Univerzita Karlova, Ústřední knihovna, Ovocný trh 560/5, 116 36 Praha 1; email: admin-repozitar [at] cuni.cz

Za dodržení všech ustanovení autorského zákona jsou zodpovědné jednotlivé složky Univerzity Karlovy. / Each constituent part of Charles University is responsible for adherence to all provisions of the copyright law.

Upozornění / Notice: Získané informace nemohou být použity k výdělečným účelům nebo vydávány za studijní, vědeckou nebo jinou tvůrčí činnost jiné osoby než autora. / Any retrieved information shall not be used for any commercial purposes or claimed as results of studying, scientific or any other creative activities of any person other than the author.

DSpace software copyright © 2002-2015  DuraSpace
Theme by 
@mire NV