Sciweavers

1182 search results - page 124 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
UAI
2003
15 years 4 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 9 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
GECCO
2010
Springer
162views Optimization» more  GECCO 2010»
15 years 7 months ago
Heuristics for sampling repetitions in noisy landscapes with fitness caching
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
Forrest Stonedahl, Susa H. Stonedahl
SDM
2010
SIAM
168views Data Mining» more  SDM 2010»
15 years 1 months ago
Convex Principal Feature Selection
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
Mahdokht Masaeli, Yan Yan, Ying Cui, Glenn Fung, J...
FOCS
2005
IEEE
15 years 8 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys