Results 331 to 340 of about 746,739 (376)

Teacups, a Python Package for the Simulation of Time-Resolved EPR Spectra of Spin-Polarized Multi-Spin Systems. [PDF]

J Phys Chem A
Quintes T, Weber S, Richert S.
europepmc   +1 more source

Ab initio simulation of spin-charge qubits based on bilayer graphene-WSe₂ quantum dots. [PDF]

NPJ 2D Mater Appl
Ge H, Koopmann P, Mrcarica F, Schmidt OTP, Bouquet I, Dossena M, Luisier M, Cao J.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Hamiltonian-Driven Adaptive Dynamic Programming With Efficient Experience Replay

IEEE Transactions on Neural Networks and Learning Systems, 2022
This article presents a novel efficient experience-replay-based adaptive dynamic programming (ADP) for the optimal control problem of a class of nonlinear dynamical systems within the Hamiltonian-driven framework.
Yongliang Yang, Yongping Pan, Chengzhong Xu, D. Wunsch   +3 more
semanticscholar   +1 more source

Hamiltonian-Driven Adaptive Dynamic Programming With Approximation Errors

IEEE Transactions on Cybernetics, 2021
In this article, we consider an iterative adaptive dynamic programming (ADP) algorithm within the Hamiltonian-driven framework to solve the Hamilton–Jacobi–Bellman (HJB) equation for the infinite-horizon optimal control problem in continuous time for ...
Yongliang Yang, H. Modares, K. Vamvoudakis, W. He, Chengzhong Xu, D. Wunsch   +5 more
semanticscholar   +1 more source

The No-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo

Journal of machine learning research, 2011
Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) algorithm that avoids the random walk behavior and sensitivity to correlated parameters that plague many MCMC methods by taking a series of steps informed by first-order gradient ...
M. Hoffman, A. Gelman
semanticscholar   +1 more source

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters, 2005
A Hamiltonian cycle is a spanning cycle in a graph, i.e., a cycle through every vertex, and a Hamiltonian path is a spanning path. In this paper we present two theorems stating sufficient conditions for a graph to possess Hamiltonian cycles and Hamiltonian paths.
Mohammad Kaykobad, M. Sohel Rahman
openaire   +1 more source

Hamiltonian Systems with Convex Hamiltonians

2004
A well-known theorem states that if a level surface of a Hamiltonian is convex, then it contains a periodic trajectory of the Hamiltonian system [142], [147]. In this chapter we prove a more general statement as an application of optimal control theory for linear systems.
Yuri L. Sachkov, Andrei A. Agrachev
openaire   +2 more sources

Port-Hamiltonian Systems Theory: An Introductory Overview

Found. Trends Syst. Control., 2014
An up-to-date survey of the theory of port-Hamiltonian systems is given, emphasizing novel developments and relationships with other formalisms. Port-Hamiltonian systems theory yields a systematic framework for network modeling of multi-physics systems ...
A. Schaft, D. Jeltsema
semanticscholar   +1 more source

Realizing the classical XY Hamiltonian in polariton simulators.

Nature Materials, 2016
The vast majority of real-life optimization problems with a large number of degrees of freedom are intractable by classical computers, since their complexity grows exponentially fast with the number of variables. Many of these problems can be mapped into
P. Lagoudakis, Matteo Silva, P. Cilibrizzi, Alexis Askitopoulos, K. Kalinin, N. Berloff, W. Langbein   +6 more
semanticscholar   +1 more source