This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
The concept of virtual holonomic constraints is extended to the case of double support, which is characterized by a closed kinematic chain and redundancy in the state variables. An...
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...