Sciweavers

3894 search results - page 351 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
JFPLC
2003
15 years 7 months ago
Une approche hybride pour l'optimisation multi-objectif sous contraintes
ABSTRACT. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary c...
Vincent Barichard, Jin-Kao Hao
JAIR
2011
114views more  JAIR 2011»
14 years 9 months ago
Properties of Bethe Free Energies and Message Passing in Gaussian Models
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
Botond Cseke, Tom Heskes
180
Voted
FLAIRS
2004
15 years 7 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
SIAMJO
2010
246views more  SIAMJO 2010»
15 years 4 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
162
Voted
WSC
2008
15 years 8 months ago
Discrete stochastic optimization using linear interpolation
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
Honggang Wang, Bruce W. Schmeiser