Sciweavers

4507 search results - page 301 / 902
» Generalized Binet dynamics
Sort
View
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
16 years 4 days ago
Towards identifying populations that increase the likelihood of success in genetic programming
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...
Jason M. Daida
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
16 years 4 days ago
EA models and population fixed-points versus mutation rates for functions of unitation
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...
J. Neal Richter, John Paxton, Alden H. Wright
POPL
1998
ACM
15 years 11 months ago
Maximal Static Expansion
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
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
15 years 10 months ago
Virtual holonomic constraint approach for planar bipedal walking robots extended to double support
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...
Michael Scheint, Marion Sobotka, Martin Buss
COMPSAC
2004
IEEE
15 years 10 months ago
Adaptive Time-Critical Resource Management Using Time/Utility Functions: Past, Present, and Future
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...
Peng Li, Binoy Ravindran, E. Douglas Jensen