Sökning: "algoritm"
Visar resultat 1 - 5 av 163 avhandlingar innehållade ordet algoritm.
1. Representation of Quantum Algorithms with Symbolic Language and Simulation on Classical Computer
Sammanfattning : Utvecklandet av kvantdatorn är ett ytterst lovande projekt som kombinerar teoretisk och experimental kvantfysik, matematik, teori om kvantinformation och datalogi. Under första steget i utvecklandet av kvantdatorn låg huvudintresset på att skapa några algoritmer med framtida tillämpningar, klargöra grundläggande frågor och utveckla en experimentell teknologi för en leksakskvantdator som verkar på några kvantbitar. LÄS MER
2. Exploiting Prior Information in Parametric Estimation Problems for Multi-Channel Signal Processing Applications
Sammanfattning : This thesis addresses a number of problems all related to parameter estimation in sensor array processing. The unifying theme is that some of these parameters are known before the measurements are acquired. LÄS MER
3. Input Calibration, Code Validation and Surrogate Model Development for Analysis of Two-phase Circulation Instability and Core Relocation Phenomena
Sammanfattning : Code validation and uncertainty quantification are important tasks in nuclear reactor safety analysis. Code users have to deal with large number of uncertain parameters, complex multi-physics, multi-dimensional and multi-scale phenomena. LÄS MER
4. Scheduling of parallel matrix computations and data layout conversion for HPC and Multi-Core Architectures
Sammanfattning : Dense linear algebra represents fundamental building blocks in many computational science and engineering applications. The dense linear algebra algorithms must be numerically stable, robust, and reliable in order to be usable as black-box solvers by expert as well as non-expert users. LÄS MER
5. On particle-based online smoothing and parameter inference in general hidden Markov models
Sammanfattning : This thesis consists of two papers studying online inference in general hidden Markov models using sequential Monte Carlo methods.The first paper present an novel algorithm, the particle-based, rapid incremental smoother (PaRIS), aimed at efficiently perform online approximation of smoothed expectations of additive state functionals in general hidden Markov models. LÄS MER