This paper introduces a Minimum Description Length (MDL) principle to de ne tness functions in Genetic Programming (GP). In traditional (Koza-style) GP, the size of trees was usually controlled by user-de ned parameters, such as the maximum number of nodes and maximum tree depth. Large tree sizes meant that the time necessary to measure their tnesses often dominated total processing time. To ov...

In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment, motivated by real-world graphs such as the Web or Internet topology. Typically these models are designed to mimic particular properties observed in the graphs, such as power-law degree distribution or the small-world phenomenon. The mainstream approach to comparing models for these graphs...

It is shown that the diffusion equation and its adjoint (time reversed) equation can be derived with only a few assumptions, using an information-theoretic approach based on the principle of minimum Fisher information. PACS: 05.40.+j; 89.70.+c

Rapid arm-reaching movements serve as an excellent test bed for any theory about trajectory formation. How are these movements planned? A minimum acceleration criterion has been examined in the past, and the solution obtained, based on the Euler-Poisson equation, failed to predict that the hand would begin and end the movement at rest (i.e., with zero acceleration). Therefore, this criterion wa...

This article shows the existence of weak solutions of a resonance problem for nonuniformly p-Laplacian system in a bounded domain in $mathbb{R}^N$‎. ‎Our arguments are based on the minimum principle and rely on a generalization of the Landesman-Lazer type condition‎.