2899 search results - page 345 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
127
click to vote
GECCO
2005
Springer
16 years 1 days ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
168
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
168
click to vote
ICANN
2010
Springer
15 years 6 months ago
2010
Springer
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
205
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Lossy compression of hyperspectral and ultraspectral images is traditionally performed using 3D transform coding. This approach yields good performance, but its complexity and mem...
211
click to vote
GI
1998
Springer
15 years 10 months ago
1998
Springer
"KnowledgeMiner" was designed to support the knowledge extraction process on a highly automated level. Implemented are 3 different GMDH-type self-organizing modeling algo...