Results 41 to 50 of about 8,796 (225)
The Path-Distance-Width of Hypercubes
Discussiones Mathematicae Graph Theory, 2013 The path-distance-width of a connected graph G is the minimum integer w satisfying that there is a nonempty subset of S ⊆ V (G) such that the number of the vertices with distance i from S is at most w for any nonnegative integer i.
Otachi Yota
doaj +1 more source
Advanced Intelligent Discovery, EarlyView.This perspective highlights how knowledge‐guided artificial intelligence can address key challenges in manufacturing inverse design, including high‐dimensional search spaces, limited data, and process constraints. It focused on three complementary pillars—expert‐guided problem definition, physics‐informed machine learning, and large language model ...
Hugon Lee +3 more
wiley +1 more source
Partitioning the hypercube into smaller hypercubes
Illinois Journal of MathematicsProofs slightly shortened and referee comments ...
Alon, Noga +2 more
openaire +3 more sources
Advanced Intelligent Discovery, EarlyView.Heat generation in lithium‐ion batteries affects performance, aging, and safety, requiring accurate thermal modeling. Traditional methods face efficiency and adaptability challenges. This article reviews machine learning‐based and hybrid modeling approaches, integrating data and physics to improve parameter estimation and temperature prediction ...
Qi Lin +4 more
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.This article establishes a Taguchi–Bayesian sampling strategy to reconstruct polymer processing–property landscape at minimal sampling cost, generically building the roadmap for materials database construction from sampling their vast design space. This sampling strategy is featured by an alternating lesson between uniformity and representativeness ...
Han Liu, Liantang Li
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.This study reveals that sampling strategy (i.e., sampling size and approach) is a foundational prerequisite for building accurate and generalizable AI models in peptide discovery. Reaching a threshold of 7.5% of the total tetrapeptide sequence space was essential to ensure reliable predictions.
Meiru Yan +3 more
wiley +1 more source
DataSemantic indexing ensures better organization and optimized searching of heterogeneous, autonomous, and distributed data sources. This approach leverages meaning and context rather than just keywords to better manage the increasing volume, complexity ...
Mohammed Ammari +2 more
doaj +1 more source
Existence of 3-regular subgraphs in Cartesian product of cycles
AKCE International Journal of Graphs and Combinatorics, 2019 Let be a graph obtained by taking the Cartesian product of finitely many cycles. It is known that is bipancyclic, that is, contains cycles of every even length from 4 to We extend this result for the existence of 3-regular subgraphs in We prove that ...
Y.M. Borse, J.B. Saraf
doaj +1 more source
Multipacking in Hypercubes [PDF]
CoRRFor an undirected graph $G$, a dominating broadcast on $G$ is a function $f : V(G) \rightarrow \mathbb{N}$ such that for any vertex $u \in V(G)$, there exists a vertex $v \in V(G)$ with $f(v) \geqslant 1$ and $d(u,v) \leqslant f(v)$. The cost of $f$ is $\sum_{v \in V} f(v)$.
Deepak Rajendraprasad +3 more
openaire +2 more sources
Applying machine learning to pharmacovigilance data: A proof‐of‐concept study
British Journal of Clinical Pharmacology, EarlyView.Aim Machine learning (ML) applications in pharmacovigilance remain limited and underexplored. Using data from the French National pharmacovigilance database (FNPV), this proof‐of‐concept study aimed to assess the feasibility of using a ML algorithm—eXtreme Gradient Boosting (XGBoost)—combined with SHapley Additive exPlanations (SHAP) analysis, to ...
Romain Barus +6 more
wiley +1 more source