Sciweavers

393 search results - page 53 / 79
» Convex Programming Methods for Global Optimization
Sort
View
CEC
2009
IEEE
14 years 2 months ago
Performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on the CEC09 test problems
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
Santosh Tiwari, Georges Fadel, Patrick Koch, Kalya...
CC
2010
Springer
117views System Software» more  CC 2010»
14 years 2 months ago
Punctual Coalescing
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...
Fernando Magno Quintão Pereira, Jens Palsbe...
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 7 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
ICML
2005
IEEE
14 years 8 months ago
Fast maximum margin matrix factorization for collaborative prediction
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
Jason D. M. Rennie, Nathan Srebro
ICC
2007
IEEE
116views Communications» more  ICC 2007»
13 years 11 months ago
Robust Power Allocation for Amplify-and-Forward Relay Networks
Relay power allocation has been shown to provide substantial performance gain in wireless relay networks when perfect global channel state information (CSI) is available. In this p...
Tony Q. S. Quek, Moe Z. Win, Hyundong Shin, Marco ...