Results 291 to 300 of about 154,862 (311)

Generalized Hamiltonian Paths in Tournaments

1984
Publisher Summary A tournament is an orientation of a complete graph. Any two vertices (players) v, w are adjacent by exactly one arc, either v → w (v beats w) or w → v. Every tournament Tn has a Hamiltonian path—that is, every tournament Tn realizes the sequences 1, . . . , 1 and 0,. . . , 0.
openaire   +2 more sources

Hamiltonian-Driven Adaptive Dynamic Programming With Approximation Errors

IEEE Transactions on Cybernetics, 2022
Chengzhong Xu, Donald C Wunsch, Hamidreza Modares   +2 more
exaly  

Bayesian Elastic Full‐Waveform Inversion Using Hamiltonian Monte Carlo

Journal of Geophysical Research: Solid Earth, 2020
Lars Gebraad, Christian Boehm, Andreas Fichtner   +2 more
exaly  

Twisted bilayer graphene. III. Interacting Hamiltonian and exact symmetries

Physical Review B, 2021
B Andrei Bernevig, Zhi-da Song, Nicolas Regnault   +2 more
exaly  

Hamiltonian theory of guiding-center motion

Reviews of Modern Physics, 2009
J R Cary, Alain J Brizard
exaly  

Non-canonical Hamiltonian structure and Poisson bracket for two-dimensional hydrodynamics with free surface

Journal of Fluid Mechanics, 2019
A I Dyachenko, P M Lushnikov, Vladimir E Zakharov   +2 more
exaly  

Adaptive control of time‐varying uncertain non‐linear systems with input delay: a Hamiltonian approach

IET Control Theory and Applications, 2016
Baozeng Fu, Weiwei Sun
exaly  

The Artificial Hamiltonian, First Integrals, and Closed-Form Solutions of Dynamical Systems for Epidemics

Zeitschrift Fur Naturforschung - Section A Journal of Physical Sciences, 2018
R Naz, Imran Naeem
exaly  

Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph

Journal of Combinatorial Designs, 2013
Francesca Merola, Marco Buratti
exaly  

Hyper hamiltonian laceability of Cayley graphs generated by transpositions

Networks, 2006
Toru Araki
exaly