Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Gentropy is a genetic programming system that evolves two-dimensional procedural textures. It synthesizes textures by combining mathematical and image manipulation functions into ...
In recent years, gradient-based LSTM recurrent neural networks (RNNs) solved many previously RNN-unlearnable tasks. Sometimes, however, gradient information is of little use for t...
The explicit solution of the filtering problem with exponential criteria for a general Gaussian signal is obtained through an approach which is based on a conditional Cameron-Mart...