Results 271 to 280 of about 1,860,621 (344)

Challenges and strategies for first-principles simulations of two-dimensional magnetic phenomena.

Nanoscale
Garrido Aldea J, Esteras DL, Roche S, Garcia JH.   +3 more
europepmc   +1 more source

Equivalence of charged and neutral density functional formulations for correcting the many-body self-interaction of polarons

Falletta S, Coulter J, Varley JB, Åberg D, Sadigh B, Kozinsky B, Pasquarello A.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Hamiltonian Path-Integral Methods

Reviews of Modern Physics, 1966
A path-integral formulation of quantum mechanics is investigated which is closely related to that of Feynman. It differs from Feynman's formulation in that it involves the Hamiltonian function of the canonically conjugate coordinates and momenta.
C. Garrod
semanticscholar   +2 more sources

Nanopore decoding for a Hamiltonian path problem.

Nanoscale, 2021
DNA computing has attracted attention as a tool for solving mathematical problems due to the potential for massive parallelism with low energy consumption.
Sotaro Takiguchi, R. Kawano
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

Hamiltonian path graphs

Journal of Graph Theory, 1983
AbstractThe Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v are adjacent if and only if G contains a Hamiltonian u‐v path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonian path graphs is presented.
Chartrand, Gary, Kapoor, S. F., Nordhaus, E. A.   +2 more
openaire   +1 more source

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rahman, M. Sohel, Kaykobad, M.
openaire   +1 more source

Structure Fault-Tolerant Hamiltonian Cycle and Path Embeddings in Bipartite $k$-Ary $n$-Cube Networks

IEEE Transactions on Reliability
One of the important issues in evaluating an interconnection network is to study the fault-tolerant Hamiltonian cycle and Hamiltonian path embedding problems. The $k$-ary $n$-cube (denoted by $Q^{k}_{n}$) networks are used as interconnection networks for
Eminjan Sabir, Jianxi Fan, J. Meng, B. Cheng   +3 more
semanticscholar   +1 more source