Sciweavers

13621 search results - page 107 / 2725
» Computability and Complexity in Self-assembly
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 3 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
SIMUTOOLS
2008
13 years 11 months ago
SIMCAN: a SIMulator framework for computer architectures and storage networks
This paper presents an OMNeT-based Framework to simulate large complex storage networks, with its corresponding underlying subsystems (I/O, Networking, etc.). With this Framework,...
Alberto Nuñez, Javier Fernández, Jos...
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 10 months ago
Complexity of some Path Problems in DAGs and Linear Orders
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
Serge Burckel
HPDC
1993
IEEE
14 years 2 months ago
An Analysis of Distributed Computing Software and Hardware for Applications in Computational Physics
We have implemented a set of computational physics codes on a network of IBM RS/6000 workstations used as a distributed parallel computer. We compare the performance of the codes ...
Paul D. Coddington