Sciweavers

28888 search results - page 379 / 5778
» Computability and complexity in analysis
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 9 days 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»
15 years 11 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
15 years 8 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...
IPPS
2009
IEEE
16 years 1 months ago
Compiler-enhanced incremental checkpointing for OpenMP applications
As modern supercomputing systems reach the peta-flop performance range, they grow in both size and complexity. This makes them increasingly vulnerable to failures from a variety ...
Greg Bronevetsky, Daniel Marques, Keshav Pingali, ...
WOSP
2004
ACM
16 years 6 days ago
Computing the performability of layered distributed systems with a management architecture
This paper analyzes the performability of client-server applications that use a separate fault management architecture for monitoring and controlling of the status of the applicat...
Olivia Das, C. Murray Woodside