Sciweavers

2126 search results - page 163 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
EVOW
2010
Springer
16 years 27 days ago
Investigating the Local-Meta-Model CMA-ES for Large Population Sizes
For many real-life engineering optimization problems, the cost of one objective function evaluation can take several minutes or hours. In this context, a popular approach to reduce...
Zyed Bouzarkouna, Anne Auger, Didier Yu Ding
SAC
2005
ACM
15 years 12 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
170
Voted
NN
2002
Springer
136views Neural Networks» more  NN 2002»
15 years 6 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
TMI
2008
116views more  TMI 2008»
15 years 6 months ago
Dynamic PET Reconstruction Using Wavelet Regularization With Adapted Basis Functions
Tomographic reconstruction from positron emission tomography (PET) data is an ill-posed problem that requires regularization. An attractive approach is to impose an 1-regularizatio...
J. Verhaeghe, Dimitri Van De Ville, I. Khalidov, Y...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 12 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál