Results 131 to 140 of about 78,303 (310)

Factorization Machine‐Based Active Learning for Functional Materials Design with Optimal Initial Data

Advanced Intelligent Discovery, EarlyView.
This work investigates the optimal initial data size for surrogate‐based active learning in functional material optimization. Using factorization machine (FM)‐based quadratic unconstrained binary optimization (QUBO) surrogates and averaged piecewise linear regression, we show that adequate initial data accelerates convergence, enhances efficiency, and ...
Seongmin Kim, In‐Saeng Suh
wiley   +1 more source

Crater Observing Bioinspired Rolling Articulator (COBRA)

Advanced Intelligent Systems, EarlyView.
Crater Observing Bio‐inspired Rolling Articulator (COBRA) is a modular, snake‐inspired robot that addresses the mobility challenges of extraterrestrial exploration sites such as Shackleton Crater. Incorporating snake‐like gaits and tumbling locomotion, COBRA navigates both uneven surfaces and steep crater walls.
Adarsh Salagame, Henry Noyes, Eric Sihite, Arash Kalantari, Alireza Ramezani   +4 more
wiley   +1 more source

Intuitionistic Fuzzy Hamiltonian Cycle by Index Matrices [PDF]

Annals of computer science and information systems, 2020
Velichka Traneva, Stoyan Tranev
doaj   +1 more source

Bridged Hamiltonian Cycles in Sub-critical Random Geometric Graphs [PDF]

, 2021
Ghurumuruhan Ganesan
openalex   +1 more source

Physical Zero-knowledge Proofs for Flow Free, Hamiltonian Cycles, and Many-to-many k-disjoint Covering Paths [PDF]

, 2022
Eammon Hart, Joshua A. McGinnis
openalex   +1 more source

On pre-Hamiltonian Cycles in Hamiltonian Digraphs

, 2014
Let $D$ be a strongly connected directed graph of order $n\geq 4$. In \cite{[14]} (J. of Graph Theory, Vol.16, No. 5, 51-59, 1992) Y. Manoussakis proved the following theorem: Suppose that $D$ satisfies the following condition for every triple $x,y,z$ of vertices such that $x$ and $y$ are non-adjacent: If there is no arc from $x$ to $z$, then $d(x)+d(y)
openaire   +2 more sources

A Note on Minimum Degree Condition for Hamiltonian $(a,b)$-Cycles in Hypergraphs [PDF]

, 2021
Jian Wang
openalex   +1 more source

Hamiltonian cycles for finite Weyl groupoids

Journal of Algebra and Its Applications
Let [Formula: see text] be the Cayley graph of a finite Weyl groupoid [Formula: see text]. In this paper, we show an existence of a Hamiltonian cycle of [Formula: see text] for any [Formula: see text]. We exactly draw a Hamiltonian cycle of [Formula: see text] for any (resp. some) irreducible [Formula: see text] of rank three (resp. four).
Takato Inoue, Hiroyuki Yamane
openaire   +2 more sources

Quantum Carnot Bound from Petz Recovery Maps

Advanced Physics Research, EarlyView.
A quantum bound (ηP$\eta_P$, the Petz Limit) is derived for the efficiency (η$\eta$) of a heat engine utilizing two‐level quantum systems (qubits) as the working substance. This limit, based on Petz recovery maps, is stricter than the classical Carnot limit (ηC$\eta_C$) for irreversible cycles.
Douglas Mundarain, Kevin Araya‐Sossa, Mario Miranda‐Rojas   +2 more
wiley   +1 more source

The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations [PDF]

, 2018
Kaiying Hou, Jayson Lynch
openalex   +1 more source