Sciweavers

5595 search results - page 60 / 1119
» Comparing Subsumption Optimizations
Sort
View
EOR
2008
156views more  EOR 2008»
14 years 12 months ago
Ant colony optimization for continuous domains
In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatoria...
Krzysztof Socha, Marco Dorigo
ESCIENCE
2006
IEEE
15 years 6 months ago
Hybrid Particle Guide Selection Methods in Multi-Objective Particle Swarm Optimization
This paper presents quantitative comparison of the performance of different methods for selecting the guide particle for multi-objective particle swarm optimization (MOPSO). Two p...
David Ireland, Andrew Lewis, Sanaz Mostaghim, Junw...
JMLR
2010
129views more  JMLR 2010»
14 years 6 months ago
Learning Polyhedral Classifiers Using Logistic Function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
Naresh Manwani, P. S. Sastry
ICASSP
2011
IEEE
14 years 3 months ago
An approximate Minimum MOSPA estimator
Optimizing over a variant of the Mean Optimal Subpattern Assignment (MOSPA) metric is equivalent to optimizing over the track accuracy statistic often used in target tracking benc...
David Frederic Crouse, Peter Willett, Marco Guerri...
EVOW
2008
Springer
15 years 1 months ago
Multiobjective Prototype Optimization with Evolved Improvement Steps
Recently, a new iterative optimization framework utilizing an evolutionary algorithm called "Prototype Optimization with Evolved iMprovement Steps" (POEMS) was introduced...
Jirí Kubalík, Richard Mordinyi, Stef...