Sciweavers

19866 search results - page 195 / 3974
» Computing all factorizations in ***
Sort
View
IPPS
2000
IEEE
15 years 11 months ago
Take Advantage of the Computing Power of DNA Computers
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA ...
Zhiquan Frank Qiu, Mi Lu
DSN
2004
IEEE
15 years 10 months ago
Fault Tolerant Computation on Ensemble Quantum Computers
In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual com...
P. Oscar Boykin, Vwani P. Roychowdhury, Tal Mor, F...
CIE
2008
Springer
15 years 8 months ago
Perfect Local Computability and Computable Simulations
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
Russell Miller, Dustin Mulcahey
EICS
2009
ACM
16 years 1 months ago
How usable are operational digital libraries: a usability evaluation of system interactions
This paper reports a usability evaluation of three operational digital libraries (DLs): the ACM DL, the IEEE Computer Society DL, and the IEEE Xplore DL. An experiment was conduct...
Xiangmin Zhang, Jingjing Liu, Yuelin Li, Ying Zhan...
CLUSTER
2008
IEEE
16 years 1 months ago
Are nonblocking networks really needed for high-end-computing workloads?
—High-speed interconnects are frequently used to provide scalable communication on increasingly large high-end computing systems. Often, these networks are nonblocking, where the...
Narayan Desai, Pavan Balaji, P. Sadayappan, Mohamm...