Sciweavers

1013 search results - page 18 / 203
» A Subexponential Algorithm for Abstract Optimization Problem...
Sort
View
SAC
2011
ACM
14 years 4 months ago
A quasi-Newton acceleration for high-dimensional optimization algorithms
Abstract In many statistical problems, maximum likelihood estimation by an EM or MM algorithm suffers from excruciatingly slow convergence. This tendency limits the application of ...
Hua Zhou, David Alexander, Kenneth Lange
ICONIP
2004
14 years 11 months ago
Genetic Algorithm for Optimal Imperceptibility in Image Communication Through Noisy Channel
Abstract. Data embedding in digital images involves a trade off relationship among imperceptibility, robustness, data security and embedding rate etc. Genetic Algorithms (GA) can b...
Santi P. Maity, Malay Kumar Kundu, Prasanta Kumar ...
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
15 years 3 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
COMPLEXITY
2004
108views more  COMPLEXITY 2004»
14 years 9 months ago
On the convergence of a factorized distribution algorithm with truncation selection
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
Qingfu Zhang
EVOW
2008
Springer
14 years 11 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...