Sciweavers

1529 search results - page 153 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 10 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
ISNN
2010
Springer
15 years 2 months ago
Particle Swarm Optimization Based Learning Method for Process Neural Networks
Abstract. This paper proposes a new learning method for process neural networks (PNNs) based on the Gaussian mixture functions and particle swarm optimization (PSO), called PSO-LM....
Kun Liu, Ying Tan, Xingui He
ICGI
2010
Springer
15 years 2 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
ICCV
1998
IEEE
16 years 6 months ago
A Metric for Distributions with Applications to Image Databases
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
Yossi Rubner, Carlo Tomasi, Leonidas J. Guibas
CORR
2007
Springer
164views Education» more  CORR 2007»
15 years 4 months ago
Consistency of the group Lasso and multiple kernel learning
We consider the least-square regression problem with regularization by a block 1-norm, that is, a sum of Euclidean norms over spaces of dimensions larger than one. This problem, r...
Francis Bach