Sciweavers

117 search results - page 8 / 24
» On the behavioral diversity of random programs
Sort
View
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
14 years 8 months ago
One line and n points
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
Bernd Gärtner, József Solymosi, Falk T...
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
14 years 1 months ago
Cellular Programming and Symmetric Key Cryptography Systems
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
Franciszek Seredynski, Pascal Bouvry, Albert Y. Zo...
GECCO
2010
Springer
129views Optimization» more  GECCO 2010»
14 years 1 months ago
A probabilistic functional crossover operator for genetic programming
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
Josh C. Bongard
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 3 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
BMCBI
2007
161views more  BMCBI 2007»
13 years 8 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo