Sciweavers

1725 search results - page 11 / 345
» Relaxed genetic programming
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Constraint relaxation in approximate linear programs
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
Marek Petrik, Shlomo Zilberstein
JSAC
2006
79views more  JSAC 2006»
13 years 7 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
ICASSP
2011
IEEE
12 years 11 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
ICCV
2009
IEEE
15 years 17 days ago
Curvature Regularity for Region-based Image Segmentation and Inpainting: A Linear Programming Relaxation
We consider a class of region-based energies for image segmentation and inpainting which combine region integrals with curvature regularity of the region boundary. To minimize s...
Thomas Schoenemann, Fredrik Kahl, Daniel Cremers
ICASSP
2011
IEEE
12 years 11 months ago
Robust SINR-constrained MISO downlink beamforming: When is semidefinite programming relaxation tight?
We consider the robust beamforming problem under imperfect channel state information (CSI) subject to SINR constraints in a downlink multiuser MISO system. One popular approach to...
Enbin Song, Qingjiang Shi, Maziar Sanjabi, Ruoyu S...