A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Distributed algorithms for building Hamiltonian cycles in k-ary n-cubes and hypercubes with faulty links
2006
12th International Conference on Parallel and Distributed Systems - (ICPADS'06)
Preserved Fulltext
Leu and Kuo, and our k-ary n-cube algorithm is the first distributed algorithm for embedding a Hamiltonian cycle in a k-ary n-cube with faulty links. ...
We use our algorithms to obtain distributed algorithms to embed Hamiltonian cycles k-ary n-cubes and hypercubes with faulty links; our hypercube algorithm improves on a recently-derived algorithm due to ...
In this paper, we are primarily interested in the distributed embedding of a Hamiltonian cycle in a k-ary n-cube when some of the links are faulty, and secondarily in a hypercube with faulty links. ...
doi:10.1109/icpads.2006.35
dblp:conf/icpads/Stewart06
fatcat:jfmvn6l5avg4xlnuqay3r7lpsi
DISTRIBUTED ALGORITHMS FOR BUILDING HAMILTONIAN CYCLES IN k-ARY n-CUBES AND HYPERCUBES WITH FAULTY LINKS
2007
Journal of Interconnection Networks (JOIN)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we are primarily interested in the distributed embedding of a Hamiltonian cycle in a k-ary n-cube when some of the links are faulty, and secondarily in a hypercube with faulty links. ...
Also, the existence of a Hamiltonian path between two nodes enables algorithms designed for linear arrays to be simulated in the (faulty) k-ary n-cube. ...
doi:10.1142/s0219265907002016
fatcat:lm2uynm63jf6fjpjoudezw2mne
Incomplete k-ary n-cube and its derivatives
2004
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We study pruned k-ary n-cubes in general and offer some additional results for the special case n ¼ 3: r ...
Incomplete or pruned k-ary n-cube, nX3; is derived as follows. ...
In Theorem 6, we build four parallel paths between two nodes in an incomplete k-ary n-cube with kX4n À 4 and derive their maximum length. ...
doi:10.1016/j.jpdc.2003.11.009
fatcat:b6zqz2utbjbkhel7xzajmvmlmm
A general algorithm for detecting faults under the comparison diagnosis model
2010
2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For 'dimensional' networks such as hypercubes, crossed cubes, k-ary n-cubes, and so on, the resulting algorithm takes time exponential in the actual dimension. ...
A graph called the augmented k-ary n-cube AQ n,k was recently defined in [25] and is an extension of the k-ary n-cube in a manner analogous to the extension of an n-dimensional hypercube to an n-dimensional ...
doi:10.1109/ipdps.2010.5470369
dblp:conf/ipps/Stewart10
fatcat:7s7cnxob4zgjrfuu4icws3stye
Routing in modular fault-tolerant multiprocessor systems
1995
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the presence off faults in hypercubes and tori, we show that the worst case length of the message route is min {cr + f, (K + l)o} + c where cr is the shortest path in the absence of faults, K is the ...
In this paper, we consider a class of modular multiprocessor architectures in which spares are added to each module to cover for faulty nodes within that module, thus forming a faulttolerant basic block ...
Lemma 1 may be applied to other architectures such as k-ary trees, Cube Connected Cycles, hypercubes, and tori. ...
doi:10.1109/71.476192
fatcat:cv5eeu6glreihgdbjdee4csl5e
2020 Index IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems Vol. 39
2020
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Myeong, I., +, TCAD Dec. 2020 4351-4358 Combating Enhanced Thermal Covert Channel in Multi-/Many-Core Systems With Channel-Aware Jamming. ...
Siracusa, M., Switching Activity of Faulty Circuits in Presence of Multiple Transition Faults. ...
doi:10.1109/tcad.2021.3054536
fatcat:wsw3olpxzbeclenhex3f73qlw4
Where Do New Ideas Come From? How Do They Emerge? Epistemology as Computation (Information Processing)
[chapter]
2007
Randomness and Complexity, From Leibniz to Chaitin
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Chaitin This book is offered with admiration and affection to Gregory J. Chaitin 1 on the occasion of his 60th birthday (25 June 2007 ). Gregory J. Chaitin, together with Ray Solomonoff and Andrei N. ...
While Chaitin's main contributions are in AIT, he was engaged in other research projects as well. His first paper [5]-published when he was 18-was in automata theory. ...
N. C. A. da Costa acknowledges support from CNPq, Philosophy Section; F. A. Doria thanks C. A. Cosenza and S. ...
doi:10.1142/9789812770837_0015
fatcat:hhtjs3z765chpebraxckg3p4hu
Subject Index to Volumes 1–75
2001
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
, 3685 , 3853
algorithm, 1020
Voronoi diagram of
a convex polygon, 2104
N line segments, 517
Voronoi diagrams, 517, 870, 1827, 2043, 2277,
2472, 3853
in 3-space, 3599
Voronoi
dual, 870
edges, ...
a graph, 441 problem, 441, 3668, 4142 Hamiltonian decomposable, 3481 decomposition, 3481 graph, 87, 1374 , 1412 , 2507 , 2757 , 2758 , 4052 Hamiltonian path, 485, 743, 1822 , 2003 , 2608 , 2643 , 3214 ...
2388, 3123 arrays , 1976 expression, 8, 463, 516, 879, 950, 1331, 1753, 1981, 2198, 2268, 3677 factors, 444 regular grammar, 55, 202, 474, 2061, 2198 forms, 683 regular graph, 2200, 2746, 3493 k-ary ...
doi:10.1016/s0020-0190(01)00175-2
fatcat:5y67tfm6yfbblakrus5nnhs73e
Influence of fundamental frequency in the perception of vowel height
1986
Journal of the Acoustical Society of America
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Furthermore, recent developments in motion picture presentation technology involving films with extended dynamic and frequency ranges have led to reconsideration of and, in some ca•a, adaptation of conventional ...
The currency dispeuser had gear noise which resonated with the machine structure at the gear mesh frequency. ...
. 4:53 LI8. k•n•11•ls word aud •nte•ce • i•ttert• • • by n•-•fi• s•e•. ...
doi:10.1121/1.2023451
fatcat:azf66ehedjhopeom7ryftavom4
Globalizing Domain-Specific Languages (Dagstuhl Seminar 14412) Optimal Algorithms and Proofs (Dagstuhl Seminar 14421) Modeling, Verification, and Control of Complex Systems for Energy Networks (Dagstuhl Seminar 14441) Symbolic Execution and Constraint Solving (Dagstuhl Seminar 14442)
2014
Constraints
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
At the same time, we show that there is no monotone projection whatsoever that reduces Subgraph(M 3 ) to Subgraph(P 3 + M 2 ) (P 3 is a path on 3 vertices, M k is a matching with k edges, and "+" stands ...
Massimo Lauria There is a natural way to express in CNF form that a graph G = ([n], E) contains a clique of size k (i.e., a set of k vertices pairwise connected by edges). ...
Many Smart Grid business models, like Demand-response programs, deal with selling or buying flexibility. This is driven by revenues, savings or incentives. ...
fatcat:zxrfsk6qcjharpg4vb5hosp4bu
Development of a mobile positron trap for future space applications
2020
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
Such rockets are developed by ARIS, a student association enabling hands-on experience within an interdisciplinary project team. Positrons storing for 3 µs is achieved. ...
I also want to thank ARIS for all the opportunities they provided me in the past years. ...
Further, I want to thank Michael Heiss, Gianluca Janka, and Johannes Wütrich for their patience while explaining me paths around dead ends, especially with electronics and laboratory equipment. ...
doi:10.3929/ethz-b-000584305
fatcat:fmjbrgvjwrhrrdidfi4t32ylky
Grammar-guided reconstruction of semantic 3D building models from airborne LiDAR data using half-space modeling
[article]
2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For many applications, realistic building models are an essential component of a 3D city model. Their manual reconstruction provides good results but is associated with a very high time expenditure. ...
This knowledge is modeled for each building in a separate multi-scale knowledge graph. The use of the grammar, together with the multi-sca [...] ...
Since the subgraph isomorphism problem is a generalization of both the problem of testing whether a graph contains a Hamiltonian cycle, which is a closed path in the graph that visits each node exactly ...
doi:10.14279/depositonce-6803
fatcat:pfill4ghcnf7tirrlzyjeis3i4