Sciweavers

1110 search results - page 98 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 2 months ago
Inside a predator-prey model for multi-objective optimization: a second study
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
Christian Grimme, Karlheinz Schmitt
NIPS
2007
15 years 17 days ago
Convex Relaxations of Latent Variable Training
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
Yuhong Guo, Dale Schuurmans
JMLR
2010
118views more  JMLR 2010»
14 years 6 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 6 months ago
Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks
—The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is...
Arash Khabbazibasmenj, Sergiy A. Vorobyov
MICAI
2005
Springer
15 years 4 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...