A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
In this paper we shall represent strategic planning problems by dynamic decision trees, in which the nodes are projects that can be deferred or postponed for a certain period of t...
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...
We propose a dynamical systems model that captures the daily fluctuations of human weight change, incorporating both physiological and psychological factors. The model consists of...
J.-Emeterio Navarro-Barrientos, Daniel E. Rivera, ...