Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"Parallel Tempering"”.

  1. Thermodynamic properties of mixed Lennard -Jones atomic clusters

    … of an advanced sampling technique, the parallel tempering method. Results have been obtained over a wide range of temperature for all binary mixed cluster species containing up to fourteen atoms.</p><p>A primary focus in this work was the calculation of cluster free energies and other …

    unh-thes Repository record for Thermodynamic properties of mixed Lennard -Jones atomic clusters (opens in a new tab)

  2. Monte Carlo Methods in Practice and Efficiency Enhancements via Parallel Computation

    … up Monte Carlo algorithms by running them in parallel computing environments. The compute time of Monte Carlo algorithms is random and can vary depending on the current state of the Markov chain. Other computing-infrastructure related factors, such as competing jobs on the same processor, or …

    cambridge Repository record for Monte Carlo Methods in Practice and Efficiency Enhancements via Parallel Computation (opens in a new tab)

  3. Computational Studies of Correlated Electrons in One-Dimension

    … Monte Carlo method and the use of Quantum Parallel Tempering to improve the quality of the numerical data. For the extended Hubbard model at half-filling, we have confirmed the existence of a recently reported bond-order wave phase for the ground state in a small region of parameter space …

    uiuc Repository record for Computational Studies of Correlated Electrons in One-Dimension (opens in a new tab)

  4. Optimal Geometric Trimming of B-spline Surfaces for Aircraft Design

    … errors and obtain higher accuracy. The hybrid Parallel Tempering and Simulated Annealing optimization method, which is an effective algorithm to overcome the slow convergence waiting dilemma and initial value sensitivity, is applied for the minimization of B-spline surface representation …

    vt Repository record for Optimal Geometric Trimming of B-spline Surfaces for Aircraft Design (opens in a new tab)

  5. Feature reinforcement learning agents

    … practical PhiMDP agent using stochastic search (parallel tempering) over some space of feature maps (state representation functions, or shortly models) for minimizing a PhiMDP cost criterion; and provide a thorough comparative empirical analysis of the proposed algorithm on the class of context …

    aus-cath Repository record for Feature reinforcement learning agents (opens in a new tab)

  6. Feature reinforcement learning agents

    … practical PhiMDP agent using stochastic search (parallel tempering) over some space of feature maps (state representation functions, or shortly models) for minimizing a PhiMDP cost criterion; and provide a thorough comparative empirical analysis of the proposed algorithm on the class of context …

    anu Repository record for Feature reinforcement learning agents (opens in a new tab)

  7. Investigation of Ni-Ceria Nanocatalysts: Improved Computational Methods Towards Hydrogen Production in Aquaprocessing of Heavy Oil

    … further investigation of the NPs by mass-scaled parallel-tempering Born-Oppenheimer molecular dynamics (PT-BOMD) resulted in the same global minima (GM) structures found by AL, demonstrating the robustness of our AL search. This AL strategy has shown to be a powerful tool for learning from small …

    calgary Repository record for Investigation of Ni-Ceria Nanocatalysts: Improved Computational Methods Towards Hydrogen Production in Aquaprocessing of Heavy Oil (opens in a new tab)

  8. Unconventional computing platforms and nature-inspired methods for solving hard optimisation problems

    … such as the Hopfield-Tank neural networks and parallel tempering, we consider a recent physics-inspired algorithm, namely chaotic amplitude control, and exact commercial solver, Gurobi. For a proper evaluation of physical simulators, we further discuss the importance of detecting easy instances …

    cambridge Repository record for Unconventional computing platforms and nature-inspired methods for solving hard optimisation problems (opens in a new tab)

  9. Gain-Based Computing for Solving Optimisation Problems

    … is compared to the powerful classical heuristic parallel tempering algorithm. We utilise the time-to-solution metric to analyse and compare the expected time to achieve an N-queens solution when each method is implemented on its natural hardware. This allows us to examine the possibility of an …

    cambridge Repository record for Gain-Based Computing for Solving Optimisation Problems (opens in a new tab)