Results 101 to 110 of about 6,714 (280)

Lobsters with an almost perfect matching are graceful [PDF]

open access: yes, 2014
Let $T$ be a lobster with a matching that covers all but one vertex.
Krop, Elliot
core  

Topology‐Aware Machine Learning for High‐Throughput Screening of MOFs in C8 Aromatic Separation

open access: yesAdvanced Intelligent Discovery, EarlyView.
We screened 15,335 Computation‐Ready, Experimental Metal–Organic Frameworks (CoRE‐MOFs) using a topology‐aware machine learning (ML) model that integrates structural, chemical, pore‐size, and topological descriptors. Top‐performing MOFs exhibit aromatic‐enriched cavities and open metal sites that enable π–π and C–H···π interactions, serving as ...
Yu Li, Honglin Li, Jialu Li, Wan‐Lu Li
wiley   +1 more source

On Gracefully Labeling Trees

open access: yes, 2013
A method to obtain all possible graceful spanning trees in a complete graph is proposed. An algorithm to generate all the labeled spanning trees in a complete graph is developed and modified to generate all graceful spanning trees.
Mehendale, Dhananjay P.
core  

Context Awareness and Human–Robot Interaction Optimization for Museum Intelligent Guide Robot

open access: yesAdvanced Intelligent Systems, EarlyView.
This study presents a context‐aware human–robot interaction framework designed for intelligent museum guide robots. The system features a three‐layer architecture—perception, understanding, and behavior execution—that enables adaptive and meaningful interactions with museum visitors.
Anna Zou, Yue Meng, Shijing Tong
wiley   +1 more source

On Integer Additive Set-Indexers of Graphs [PDF]

open access: yes, 2014
A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \rightarrow2^{X}$ such that the function $f^{\oplus}:E(G)\rightarrow2^{X}-\{\emptyset\}$ defined by $f^{\oplus}(uv) = f(u){\oplus} f(v)$ for every $uv{\in} E(G)$ is also injective ...
Germina, K. A., Sudev, N. K.
core   +2 more sources

Bayesian Optimisation for the Experimental Sciences: A Practical Guide to Data‐Efficient Optimisation of Laboratory Workflows

open access: yesAdvanced Intelligent Systems, EarlyView.
This study provides an introduction to Bayesian optimisation targeted for experimentalists. It explains core concepts, surrogate modelling, and acquisition strategies, and addresses common real‐world challenges such as noise, constraints, mixed variables, scalability, and automation.
Chuan He   +2 more
wiley   +1 more source

Graceful labeling of triangular extension of complete bipartite graph

open access: yesElectronic Journal of Graph Theory and Applications, 2019
For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km, n ⊙ K2 as triangular extension of complete bipartite graph Km, n, since there is a triangle hanging from every vertex of Km, n.
Sarbari Mitra, Soumya Bhoumik
doaj   +1 more source

Artificial Intelligence in Autonomous Mobile Robot Navigation: From Classical Approaches to Intelligent Adaptation

open access: yesAdvanced Intelligent Systems, EarlyView.
Artificial intelligence (AI) is reshaping autonomous mobile robot navigation beyond classical pipelines. This review analyzes how AI techniques are integrated into core navigation tasks, including path planning and control, localization and mapping, perception, and context‐aware decision‐making. Learning‐based, probabilistic, and soft‐computing methods
Giovanna Guaragnella   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy