Results 31 to 40 of about 16,549 (235)
A new and flexible method for constructing designs for computer experiments
, 2010 We develop a new method for constructing "good" designs for computer experiments. The method derives its power from its basic structure that builds large designs using small designs.
Bingham, Derek +3 more
core +1 more source
On the performance of routing algorithms in wormhole-switched multicomputer networks [PDF]
, 2005 This paper presents a comparative performance study of adaptive and deterministic routing algorithms in wormhole-switched hypercubes and investigates the performance vicissitudes of these routing schemes under a variety of network operating conditions ...
Ould-Khaoua, M., Shahrabi, A.
core +1 more source
Graphs obtained from collections of blocks
Electronic Journal of Graph Theory and Applications, 2015 Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially ...
Colton Magnant +2 more
doaj +1 more source
Extended hypercube: a hierarchical interconnection network of hypercubes [PDF]
IEEE Transactions on Parallel and Distributed Systems, 1992 A new interconnection topology-the extended hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a constant predefined building block. The extended hypercube retains the positive features of the k-cube at different levels of hierarchy and at the same ...
Kumar, Mohan J, Patnaik, LM
openaire +2 more sources
Journal of Mathematical Sciences and Modelling, 2018 We obtain the generating functions for the combinatorial enumeration of colorings of all hyperplanes of hypercubes for all irreducible representations of the hyperoctahedral groups.
Krishnan Balasubramanian
doaj +1 more source
Regularity of optimal mapping between hypercubes
Advanced Nonlinear Studies, 2023 In this note, we establish the global C3,α{C}^{3,\alpha } regularity for potential functions in optimal transportation between hypercubes in Rn{{\mathbb{R}}}^{n} for n≥3n\ge 3. When n=2n=2, the result was proved by Jhaveri.
Chen Shibing, Liu Jiakun, Wang Xu-Jia
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2014 Summary: Let \(G\) be a graph that is a subgraph of some \(n\)-dimensional hypercube \(Q_n\). For sufficiently large \(n\), \textit{Q. Stout} [``Packings in hypercubes'', presented at the 21st Southeastern international conference on combinatorics, graph theory, and computing, Boca Raton, FL (1990), \url{http://www.eecs.umich.edu/~qstout/abs/hyppack ...
openaire +3 more sources
Some Properties on Estrada Index of Folded Hypercubes Networks
Abstract and Applied Analysis, 2014 Let G be a simple graph with n vertices and let λ1,λ2,…,λn be the eigenvalues of its adjacency matrix; the Estrada index EEG of the graph G is defined as the sum of the terms eλi, i=1,2,…,n.
Jia-Bao Liu, Xiang-Feng Pan, Jinde Cao
doaj +1 more source
SIAM Journal on Discrete MathematicsA subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = A+A = \{a + b \ | \ a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. We prove that the number of sumsets in $\mathbb{F}_2^n$ is asymptotically $(2^n-1)2^{2^{n-1}}$. Furthermore, we show that the family of sumsets in $\mathbb{F}_2^n$ is almost identical to the family of all ...
Noga Alon, Or Zamir
openaire +3 more sources
The Kirchhoff Index of Hypercubes and Related Complex Networks
Discrete Dynamics in Nature and Society, 2013 The resistance distance between any two vertices of G is defined as the network effective resistance between them if each edge of G is replaced by a unit resistor.
Jiabao Liu +3 more
doaj +1 more source