Results 101 to 110 of about 77,334 (248)
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
On the existence of Hamiltonian cycles in hypercubes [PDF]
Notes on Number Theory and Discrete MathematicsBuilding on the results of our previous work on Euclidean leaper tours, considering all integers k>1 and h>0, we study the existence of Hamiltonian cycles in the vertex set C(2,k):={0,1}ᵏ of the k-dimensional hypercube when the Euclidean distance between
Gabriele Di Pietro, Marco Ripà
doaj +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
Advanced Intelligent Systems, EarlyView.This study refines the Crystal Hamiltonian Graph Network to predict energies, structures, and lithium‐ion dynamics in halide electrolytes. By generating ordered structural models and using an iterative fine‐tuning workflow, we achieve near‐ab initio accuracy for phase stability and ionic transport predictions.
Jonas Böhm, Aurélie Champagne
wiley +1 more source
The Hamiltonian and Hypohamiltonian of Generalized Petersen Graph (GP_(n,9))
Jambura Journal of MathematicsThe study of Hamiltonian and Hypohamiltonian properties in the generalized Petersen graph GP_{n,k} is interesting due to the unique structure and characteristics of these graphs. The method employed in this study involves searching for Hamiltonian cycles
Susilawati Susilawati +3 more
doaj +1 more source
, 2013 Historically, the minimal length Hamiltonian cycles in a random point cloud lying inside a given rectangle are computed by partitioning this rectangle. We have used successive convex hulls of the set of points, in order to obtain partitions better suited for this purpose.
de Arriba Perez, Francisco +2 more
openaire +1 more source
Interfacial Ru–O–W Orbital Coupling Enables Lattice Oxygen Stabilization for Enhanced Acidic OER
Carbon Energy, EarlyView.A RuO2/WO3 electrocatalyst with strong interfacial Ru–O–W bonds exhibits optimized Ru–O interactions, enhancing intrinsic activity and stability for acidic OER. The WO3 support modulates the electronic structure of RuO2 and promotes oxo‐intermediate deprotonation, delivering a low overpotential of 203 mV at 10 mA cm−2 and sustained operation beyond 200
Tongzhou Wang +9 more
wiley +1 more source
Carbon Energy, EarlyView.A Se‐mediated Co dual‐atom catalyst replaces sluggish oxygen evolution with efficient iodide oxidation in zinc‐air/iodide hybrid batteries. Se‐induced d‐p orbital hybridization optimizes adsorption, enabling a low 0.365 V voltage gap and superior durability, fundamentally overcoming conventional kinetic bottlenecks.
Huaipeng Pang +6 more
wiley +1 more source
Energy Conditions for Hamiltonicity of Graphs
Discrete Dynamics in Nature and Society, 2014 Let G be an undirected simple graph of order n. Let A(G) be the adjacency matrix of G, and let μ1(G)≤μ2(G)≤⋯≤μn(G) be its eigenvalues. The energy of G is defined as ℰ(G)=∑i=1n|μi(G)|. Denote by GBPT a bipartite graph.
Guidong Yu +3 more
doaj +1 more source
Disjoint hamiltonian cycles in bipartite graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferrara, Michael +3 more
openaire +2 more sources