Sciweavers

ICIP
2010
IEEE
13 years 9 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...
EOR
2006
129views more  EOR 2006»
13 years 11 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano
ISNN
2004
Springer
14 years 5 months ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 5 months ago
Towards billion-bit optimization via a parallel estimation of distribution algorithm
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...
Kumara Sastry, David E. Goldberg, Xavier Llor&agra...