Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Abstract. In many real-world applications of evolutionary computation, it is essential to reduce the number of fitness evaluations. To this end, computationally efficient models c...
Quadratic elements place stringent requirements on a surface mesh smoother. One of the biggest challenges is that a good linear element may become invalid when mid-side nodes are ...