6142 search results - page 739 / 1229 » The Complexity of Partition Functions |
193
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
175
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
178
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
164
click to vote
ISNN
2007
Springer
16 years 1 months ago
2007
Springer
Modeling for the ball mill grinding process is still an imperative but difficult problem for the optimal control of mineral processing industry. Due to the integrated complexities ...
165
click to vote
MICAI
2007
Springer
16 years 1 months ago
2007
Springer
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...