Neural networks and the Kriging method are compared for constructing £tness approximation models in evolutionary optimization algorithms. The two models are applied in an identica...
In this paper, a general framework for the analysis of a connection between the training of artificial neural networks via the dynamics of Markov chains and the approximation of c...
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...