Sciweavers

16082 search results - page 352 / 3217
» Algorithms for Marketing-Mix Optimization
Sort
View
ANTSW
2010
Springer
15 years 4 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
ACL
2009
15 years 4 months ago
K-Best A* Parsing
A parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing kbest extraction methods can efficiently search for top derivations, but only after an exhau...
Adam Pauls, Dan Klein
CPAIOR
2009
Springer
16 years 1 months ago
Backdoors to Combinatorial Optimization: Feasibility and Optimality
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...
Bistra N. Dilkina, Carla P. Gomes, Yuri Malitsky, ...
CEC
2009
IEEE
16 years 1 months ago
Differential Evolution with Self-adaptation and Local Search for Constrained Multiobjective Optimization
— This paper presents Differential Evolution with Self-adaptation and Local Search for Constrained Multiobjective Optimization algorithm (DECMOSA-SQP), which uses the self-adapta...
Ales Zamuda, Janez Brest, Borko Boskovic, Viljem Z...
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
16 years 8 days ago
Bayesian optimization models for particle swarms
We explore the use of information models as a guide for the development of single objective optimization algorithms, giving particular attention to the use of Bayesian models in a...
Christopher K. Monson, Kevin D. Seppi