Results 1 to 10 of about 967 (112)
Explanation of clustering result based on multi-objective optimization. [PDF]
Clustering is an unsupervised machine learning technique whose goal is to cluster unlabeled data. But traditional clustering methods only output a set of results and do not provide any explanations of the results.
Liang Chen, Caiming Zhong, Zehua Zhang
doaj +2 more sources
Efficient Circuit Implementations of Continuous-Time Quantum Walks for Quantum Search [PDF]
Quantum walks are a powerful framework for simulating complex quantum systems and designing quantum algorithms, particularly for spatial search on graphs, where the goal is to find a marked vertex efficiently.
Renato Portugal, Jalil Khatibi Moqadam
doaj +2 more sources
Groups of Symmetries of the Two Classes of Synthetases in the Four-Dimensional Hypercubes of the Extended Code Type II [PDF]
Aminoacyl-tRNA synthetases (aaRSs) originated from an ancestral bidirectional gene (mirror symmetry), and through the evolution of the genetic code, the twenty aaRSs exhibit a symmetrical distribution in a 6-dimensional hypercube of the Standard Genetic ...
Marco V. José +2 more
doaj +2 more sources
Acyclic and star coloring parameters of fractal cubic networks [PDF]
Interconnection networks are more vital in telecommunications because of the significant raise in the demand for high-speed networks as a result of the widespread use of computers and the growth of the internet.
C. Renuga +3 more
doaj +2 more sources
Dual Protection Routing Trees on Graphs
In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node
Kung-Jui Pai
doaj +1 more source
Boolean Hypercubes: The Origin of a Tagged Recursive Logic and the Limits of Artificial Intelligence
Boolean and logical hypercubes are discussed as providers of tags to logical object sets, transforming them into logical tagged sets, a generalization of fuzzy sets.
Ramon Carbó-dorca
doaj +1 more source
Fault tolerance of balanced hypercubes
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
An edge labeled graph is a graph whose edges are labeled with non-zero ideals of a commutative ring . A Generalized Spline on an edge labeled graph is a vertex labeling of by elements of the ring , such that the difference between any two adjacent vertex
Radha Madhavi Duggaraju, Lipika Mazumdar
doaj +1 more source
Hamiltonian Cycle in Folded Hypercubes With Highly Conditional Edge Faults
As an extension of the n-dimensional hypercube Qn, the n-dimensional folded hypercube denoted as FQn, which can be structured from Qn adding an edge to every pair of vertices with complementary addresses.FQn possesses many properties superior to those of
Che-Nan Kuo, Yu-Huei Cheng
doaj +1 more source
On Locating-Dominating Codes in Binary Hamming Spaces [PDF]
Locating faulty processors in a multiprocessor system gives the motivation for locating-dominating codes. We consider these codes in binary hypercubes and generalize the concept for the situation in which we want to locate more than one malfunctioning ...
Iiro Honkala, Tero Laihonen, Sanna Ranto
doaj +3 more sources

