Results 51 to 60 of about 67,481 (208)

About message routing in different hypercube interconnection network types [PDF]

open access: yesComputer Science Journal of Moldova, 1999
The paper treats the problem of message routing in different hypercube interconnection network types. Because the communication algorithms frequently use a few basic communication operations, the purpose was to optain relationships for the total ...
M. Popa, M. Stratulat
doaj  

Distance Magic Cartesian Products of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.
Cichacz Sylwia   +3 more
doaj   +1 more source

Stochastic optimization of Power‐to‐Methanol: Production cost sensitivity to process design vs. scheduling

open access: yesAIChE Journal, EarlyView.
Abstract Under time‐varying electricity prices, the production costs of Power‐to‐X processes with intermediate storage can be reduced by simultaneously optimizing the process unit design and size with their scheduling and operation. However, the production cost sensitivity to optimal process design or scheduling is unclear, especially when several ...
Simone Mucci, Dominik Bongartz
wiley   +1 more source

The Path-Distance-Width of Hypercubes

open access: yesDiscussiones 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

Toward Knowledge‐Guided AI for Inverse Design in Manufacturing: A Perspective on Domain, Physics, and Human–AI Synergy

open access: yesAdvanced 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

Advances in Thermal Modeling and Simulation of Lithium‐Ion Batteries with Machine Learning Approaches

open access: yesAdvanced 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

Taguchi–Bayesian Sampling: A Roadmap for Polymer Database Construction Toward Small Representative Machine Learning

open access: yesAdvanced 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

Sampling Strategy: An Overlooked Factor Affecting Artificial Intelligence Prediction Accuracy of Peptides’ Physicochemical Properties

open access: yesAdvanced 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

Existence of 3-regular subgraphs in Cartesian product of cycles

open access: yesAKCE 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

Partitioning the hypercube into smaller hypercubes

open access: yesIllinois Journal of Mathematics
Proofs slightly shortened and referee comments ...
Alon, Noga   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy