Results 151 to 160 of about 1,865,243 (219)
Some of the next articles are maybe not open access.

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   +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   +3 more
semanticscholar   +1 more source

Hamiltonian Paths and Cycles

2013
In this chapter, the concepts of Hamiltonian paths and Hamiltonian cycles are discussed. In the first section, the history of Hamiltonian graphs is described, and then some concepts such as Hamiltonian paths, Hamiltonian cycles, traceable graphs, and Hamiltonian graphs are defined.
Mahtab Hosseininia, Faraz Dadgostari
openaire   +1 more source

Hamiltonian and Eulerian Paths

1983
March 14. Hamiltonian and Eulerian paths and cycles come under the general heading of “de Bruijn sequences”. The specific terms “Hamiltonian” and “Eulerian” are somewhat better known; hence this chapter has been named after them rather than de Bruijn.
George Pólya   +2 more
openaire   +1 more source

The Pizza-Cutter’s Problem and Hamiltonian Paths

Mathematics Magazine, 2019
Summary. The pizza-cutter’s problem is to determine the maximum number of pieces that can be made with n straight cuts through a circular pizza, regardless of the size and shape of the pieces.
Baril, Jean-Luc   +1 more
openaire   +1 more source

A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments

Journal of Algorithms, 1993
Summary: We propose a parallel algorithm which reduces the problem of computing Hamiltonian cycles in tournaments to the problem of computing Hamiltonian paths. The running time of our algorithm is \(O(\log n)\) using \(O(n^2/\log n)\) processors on a CRCW PRAM, and \(O(\log n \log \log n)\) on an EREW PRAM using \(O(n^2/ \log n \log \log n ...
Bampis, E.   +3 more
openaire   +1 more source

Secure key sharing scheme using Hamiltonian path

International journal of information technology, 2023
Maroti Deshmukh, A. Rawat
semanticscholar   +1 more source

Hamiltonian path integrals

2011
The properties of path integrals associated with the allowance for nonstandard terms reflecting the operator nature of the canonical variables are considered. Rules for treating such terms (''equivalence rules'') are formulated. Problems with a boundary, the behavior of path integrals under canonical transformations, and the problem of quantization of ...
openaire   +1 more source

Home - About - Disclaimer - Privacy