Results 1 to 10 of about 2,576 (97)

Fault tolerance of balanced hypercubes

open access: yes网络与信息安全学报, 2017
Fault tolerance is one of the important ways to measure the reliability of multiprocessor interconnection networks.g-restricted edge connectivity and g-restricted connectivity can ensure every remaining component is disconnected ,the number of neighbors ...
Xin-xin ZHANG, Li XU, Li-mei LIN
doaj   +3 more sources

Reliability Analysis of Subsystem in Balanced Hypercubes

open access: yesIEEE Access, 2020
The probability that a multiprocessor computer system has faults arises as the cardinality of the system grows. The subsystem reliability in a system, defined as the probability that there exists a fault-free subsystem of a specified cardinality when the
Qifan Zhang   +3 more
doaj   +1 more source

A Projection Argument for Differential Inclusions, with Applications to Persistence of Mass-Action Kinetics [PDF]

open access: yes, 2013
Motivated by questions in mass-action kinetics, we introduce the notion of vertexical family of differential inclusions. Defined on open hypercubes, these families are characterized by particular good behavior under projection maps.
Gopalkrishnan, Manoj   +2 more
core   +3 more sources

PC-CUBE: A Personal Computer Based Hypercube [PDF]

open access: yes, 1988
PC-CUBE is an ensemble of IBM PCs or close compatibles connected in the hypercube topology with ordinary computer cables. Communication occurs at the rate of 115.2 K-band via the RS-232 serial links.
Breaden, Matt   +7 more
core   +2 more sources

An ETH-Tight Exact Algorithm for Euclidean TSP [PDF]

open access: yes, 2018
We study exact algorithms for {\sc Euclidean TSP} in $\mathbb{R}^d$. In the early 1990s algorithms with $n^{O(\sqrt{n})}$ running time were presented for the planar case, and some years later an algorithm with $n^{O(n^{1-1/d})}$ running time was ...
Bodlaender, Hans L.   +4 more
core   +4 more sources

Distributed Online Learning via Cooperative Contextual Bandits [PDF]

open access: yes, 2015
In this paper we propose a novel framework for decentralized, online learning by many learners. At each moment of time, an instance characterized by a certain context may arrive to each learner; based on the context, the learner can select one of its own
Tekin, Cem, van der Schaar, Mihaela
core   +2 more sources

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

open access: yesDiscussiones Mathematicae Graph Theory, 2016
The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors.
Cao Jianxiang, Shi Minyong, Feng Lihua
doaj   +1 more source

On Counting and Embedding a Subclass of Height-Balanced Trees

open access: yesModelling and Simulation in Engineering, 2014
A height-balanced tree is a rooted binary tree in which, for every vertex v, the difference in the heights of the subtrees rooted at the left and right child of v (called the balance factor of v) is at most one. In this paper, we consider height-balanced
Indhumathi Raman
doaj   +1 more source

Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices [PDF]

open access: yes, 2015
Absolutely Maximally Entangled (AME) states are those multipartite quantum states that carry absolute maximum entanglement in all possible partitions. AME states are known to play a relevant role in multipartite teleportation, in quantum secret sharing ...
Alsina, Daniel   +4 more
core   +2 more sources

Balanced binary trees in the Tamari lattice [PDF]

open access: yes, 2010
We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T0, T1] where T0 and T1 are balanced trees are isomorphic as posets to a hypercube.
Giraudo, Samuele
core   +5 more sources

Home - About - Disclaimer - Privacy