Sciweavers

1352 search results - page 156 / 271
» Fault-Tolerant Quantum Computation
Sort
View

Presentation
324views
12 years 1 months ago
Task scheduling algorithm for multicore processor system for minimizing recovery time in case of single node fault
In this paper, we propose a task scheduling al-gorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore process...
AISC
2008
Springer
13 years 10 months ago
Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
Lucas Dixon, Ross Duncan
ISCI
2000
83views more  ISCI 2000»
13 years 7 months ago
Active agents, intelligence and quantum computing
This paper reviews evidence from neuroscience and quantum computing theory in support of the notion of autonomy in the workings of cognitive processes. De
Subhash C. Kak
PPAM
2005
Springer
14 years 1 months ago
A Web Computing Environment for Parallel Algorithms in Java
We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed ove...
Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer ...
RANDOM
1998
Springer
14 years 8 days ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang