Sciweavers

14774 search results - page 147 / 2955
» Computational complexity and evolutionary computation
Sort
View
CEC
2009
IEEE
15 years 11 months ago
What is situated evolution?
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
Martijn C. Schut, Evert Haasdijk, A. E. Eiben
UC
2005
Springer
15 years 10 months ago
Using Genetic Algorithms to Evolve Behavior in Cellular Automata
Abstract. It is an unconventional computation approach to evolve solutions instead of calculating them. Although using evolutionary computation in computer science dates back to th...
Thomas Bäck, Ron Breukelaar
COCOON
2007
Springer
15 years 10 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang
EUROCRYPT
2007
Springer
15 years 8 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 10 months ago
Evolutionary form-finding of tensegrity structures
Tensegrity structures are stable 3-dimensional mechanical structures which maintain their form due to an intricate balance of forces between disjoint rigid elements and continuous...
Chandana Paul, Hod Lipson, Francisco J. Valero Cue...