Sciweavers

2223 search results - page 84 / 445
» Ontological Framework for Approximation
Sort
View
CEC
2003
IEEE
15 years 10 months ago
Comparing neural networks and Kriging for fitness approximation in evolutionary optimization
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...
Lars Willmes, Thomas Bäck, Yaochu Jin, Bernha...
AMC
2008
99views more  AMC 2008»
15 years 4 months ago
Markov chain network training and conservation law approximations: Linking microscopic and macroscopic models for evolution
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...
Roderick V. N. Melnik
TSMC
2010
14 years 11 months ago
Incomplete Multigranulation Rough Set
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...
Yuhua Qian, Jiye Liang, Chuangyin Dang
132
Voted
ISAAC
2005
Springer
90views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Approximate Colored Range Queries
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...
Ying Kit Lai, Chung Keung Poon, Benyun Shi
AIPS
2007
15 years 7 months ago
Cost-Sharing Approximations for h+
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 ...
Vitaly Mirkis, Carmel Domshlak