Results 11 to 20 of about 2,664 (165)
Automorphism group of the balanced hypercube [PDF]
Ars Mathematica Contemporanea, 2016 Huang and Wu in [IEEE Transactions on Computers 46 (1997), pp. 484–490] introduced the balanced hypercube B H n as an interconnection network topology for computing systems. In this paper, we completely determine the full automorphism group of the balanced hypercube. Applying this, we first show that the n -dimensional balanced hypercube B
Jin-Xin Zhou +3 more
+8 more sources
The generalized 4-connectivity of balanced hypercubes
Discussiones Mathematicae Graph TheorySummary: The balanced hypercube is a kind of highly symmetrical network and possesses many good properties. Generalized connectivity is a new measurement of interconnection networks' fault tolerance. The internally disjoint \(N\)-trees are edge-disjoint trees but with intersecting vertex set \(N\).
Dongqin Cheng
doaj +3 more sources
Certain height-balanced subtrees of hypercubes [PDF]
International Journal of Computer Mathematics: Computer Systems Theory, 2016 ABSTRACTA height-balanced tree is a desired data structure for performing operations such as search, insert and delete, on high-dimensional external data storage. Its preference is due to the fact that it always maintains logarithmic height even in worst cases.
Sheshayya A. Choudum, Indhumathi Raman
openaire +2 more sources
Structure and Substructure Connectivity of Balanced Hypercubes [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2019 arXiv admin note: text overlap with arXiv:1805 ...
Huazhong Lü, Tingzeng Wu
openaire +3 more sources
Balanced parallel sort on hypercube multiprocessors [PDF]
IEEE Transactions on Parallel and Distributed Systems, 1993 A parallel sorting algorithm for sorting n elements evenly distributed over 2/sup d/ p nodes of a d-dimensional hypercube is presented. The average running time of the algorithm is O((n log n)/p+p log 2n). The algorithm maintains a perfect load balance in the nodes by determining the (kn/p)th elements (k1,. .
Abali, Bulent +2 more
openaire +3 more sources
Existence of a Maximum Balanced Matching in the Hypercube [PDF]
Journal of Statistical Theory and Practice, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katona, Gyula, Tichler, K.
openaire +1 more source
A study of the communication cost of the FFT on torus multicomputers [PDF]
, 1995 The computation of a one-dimensional FFT on a c-dimensional torus multicomputer is analyzed. Different approaches are proposed which differ in the way they use the interconnection network. The first approach is based on the multidimensional index mapping
Díaz de Cerio Ripalda, Luis Manuel +2 more
core +1 more source
Embedding multidimensional grids into optimal hypercubes [PDF]
, 2014 Let $G$ and $H$ be graphs, with $|V(H)|\geq |V(G)| $, and $f:V(G)\rightarrow V(H)$ a one to one map of their vertices. Let $dilation(f) = max\{ dist_{H}(f(x),f(y)): xy\in E(G) \}$, where $dist_{H}(v,w)$ is the distance between vertices $v$ and $w$ of $H$.
Miller, Zevi +2 more
core +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
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