197 search results - page 3 / 40 » Robust Parallel Computations through Randomization |
DFG
1992
Springer
14 years 2 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
CCS
2003
ACM
14 years 4 months ago
2003
ACM
Network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate “stepping stones” to conceal their identity and origin...
ICDCS
2007
IEEE
14 years 5 months ago
2007
IEEE
Trust negotiation supports authentication and access control across multiple security domains by allowing parties to use non-forgeable digital credentials to establish trust. By t...
SPIN
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...