Sciweavers

14774 search results - page 140 / 2955
» Computational complexity and evolutionary computation
Sort
View
MFCS
1989
Springer
15 years 8 months ago
Space Bounded Computations: Review And New Separation Results
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
Juris Hartmanis, Desh Ranjan
COMPLEXITY
2010
129views more  COMPLEXITY 2010»
15 years 1 months ago
The notion of computation is fundamental to an autonomous neuroscience
The increasing sophistication of the tools and results of cellular and molecular neuroscience would appear to suggest that explanatory force in neuroscience is defined by reductio...
Garrett Neske
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 10 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»
15 years 9 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
FOCI
2007
IEEE
15 years 8 months ago
Evolutionary Algorithms in the Presence of Noise: To Sample or Not to Sample
Abstract-- In this paper, we empirically analyze the convergence behavior of evolutionary algorithms (evolution strategies
Hans-Georg Beyer, Bernhard Sendhoff