Sciweavers

16082 search results - page 67 / 3217
» Algorithms for Marketing-Mix Optimization
Sort
View
SOCO
2010
Springer
13 years 7 months ago
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
Local genetic algorithms have been designed with the aim of providing effective intensiļ¬cation. One of their most outstanding features is that they may help classical local searc...
Carlos García-Martínez, Manuel Lozan...
SIAMJO
2000
101views more  SIAMJO 2000»
13 years 8 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
CORR
2002
Springer
78views Education» more  CORR 2002»
13 years 8 months ago
Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
SOCO
2010
Springer
13 years 7 months ago
Automatic circle detection on digital images with an adaptive bacterial foraging algorithm
This article presents an algorithm for the automatic detection of circular shapes from complicated and noisy images without using the conventional Hough transform methods. The prop...
Sambarta Dasgupta, Swagatam Das, Arijit Biswas, Aj...
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
14 years 18 days ago
On the local performance of simulated annealing and the (1+1) evolutionary algorithm
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
Thomas Jansen, Ingo Wegener