Sciweavers

5595 search results - page 413 / 1119
» Comparing Subsumption Optimizations
Sort
View
AUSAI
2004
Springer
16 years 7 days ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
DAGM
2004
Springer
16 years 7 days ago
Pixel-to-Pixel Matching for Image Recognition Using Hungarian Graph Matching
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suita...
Daniel Keysers, Thomas Deselaers, Hermann Ney
ICA
2004
Springer
16 years 6 days ago
Blind Deconvolution Using the Relative Newton Method
We propose a relative optimization framework for quasi maximum likelihood blind deconvolution and the relative Newton method as its particular instance. Special Hessian structure a...
Alexander M. Bronstein, Michael M. Bronstein, Mich...
ISNN
2004
Springer
16 years 6 days ago
Evolving Flexible Neural Networks Using Ant Programming and PSO Algorithm
A flexible neural network (FNN) is a multilayer feedforward neural network with the characteristics of: (1) overlayer connections; (2) variable activation functions for different...
Yuehui Chen, Bo Yang, Jiwen Dong
CSB
2003
IEEE
152views Bioinformatics» more  CSB 2003»
16 years 4 days ago
A Parallel Genetic Algorithm for Physical Mapping of Chromosomes
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
Suchendra M. Bhandarkar, Jinling Huang, Jonathan A...