Results 91 to 100 of about 52,480 (200)
Advanced Intelligent Discovery, EarlyView.The authors evaluated six machine‐learned interatomic potentials for simulating threshold displacement energies and tritium diffusion in LiAlO2 essential for tritium production. Trained on the same density functional theory data and benchmarked against traditional models for accuracy, stability, displacement energies, and cost, Moment Tensor Potential ...
Ankit Roy +8 more
wiley +1 more source
X‐ray magnetic circular dichroism
Major Reference Works, Page 508-515., 2022 International Tables for Crystallography is the definitive resource and reference work for crystallography and structural science.
Each of the eight volumes in the series contains articles and tables of data relevant to crystallographic research and to applications of crystallographic methods in all sciences concerned with the ...
Gerrit van der Laan C. Chantler +2 more
wiley +1 more source
A note on edge-disjoint contractible Hamiltonian cycles in polyhedral maps
Electronic Journal of Graph Theory and Applications, 2014 We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamiltonian Cycles in the edge graph of polyhedral maps.
Ashish K Upadhyay, Dipendu Maity
doaj +1 more source
Advanced Intelligent Discovery, EarlyView.Factorization machine with iterative quantum reverse annealing (FMIRA) leverages quantum reverse annealing to perform batch black‐box optimization. Factorization machine with quantum annealing (FMQA) is a widely used python package for solving black‐box optimization problems using D‐Wave quantum annealers.
Andrejs Tučs, Ryo Tamura, Koji Tsuda
wiley +1 more source
On hyper-Hamiltonian Cartesian product of undirected cycles [PDF]
Discrete Mathematics Letters, 2021 Zbigniew R. Bogdanowicz
doaj +1 more source
Advanced Intelligent Systems, EarlyView.This review explores the transformative impact of artificial intelligence on multiscale modeling in materials research. It highlights advancements such as machine learning force fields and graph neural networks, which enhance predictive capabilities while reducing computational costs in various applications.
Artem Maevskiy +2 more
wiley +1 more source
Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
Discussiones Mathematicae Graph Theory, 2018 Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and ...
Li Ruijuan, Han Tingting
doaj +1 more source
Hamiltonicity and $\sigma$-hypergraphs
Theory and Applications of Graphs, 2014 We define and study a special type of hypergraph. A $\sigma$-hypergraph $H= H(n,r,q$ $\mid$ $\sigma$), where $\sigma$ is a partition of $r$, is an $r$-uniform hypergraph having $nq$ vertices partitioned into $ n$ classes of $q$ vertices each.
Christina Zarb
doaj +1 more source
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core +1 more source
Advanced Intelligent Systems, EarlyView.This paper proposes a novel control framework to ensure safety of a robotic swarm. A feedback optimization controller is capable of driving the swarm toward a target density while keeping risk‐zone exposure below a safety threshold. Theory and experiments show how safety is more effectively achieved for sparsely connected swarms.
Longchen Niu, Gennaro Notomista
wiley +1 more source