Sciweavers

13603 search results - page 250 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
IAJIT
2006
109views more  IAJIT 2006»
15 years 6 months ago
Unconstraint Assignment Problem: A Molecular Computing Approach
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki...
GRC
2008
IEEE
15 years 7 months ago
Scalar-product based Secure Two-party Computation
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...
Chih-Hao Shen, Justin Zhan, Tsan-sheng Hsu, Churn-...
ACTA
2005
104views more  ACTA 2005»
15 years 6 months ago
Optimal recovery schemes in fault tolerant distributed computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
Kamilla Klonowska, Håkan Lennerstad, Lars Lu...
ATC
2008
Springer
15 years 8 months ago
An Operating System Architecture for Organic Computing in Embedded Real-Time Systems
To overcome the rising complexity of computing systems, the paradigms of Autonomic Computing and Organic Computing have been introduced. By using an observer/controller architectur...
Florian Kluge, Jörg Mische, Sascha Uhrig, The...
ECCC
2000
158views more  ECCC 2000»
15 years 6 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass