Sciweavers

150 search results - page 13 / 30
» Solving Small TSPs with Constraints
Sort
View
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...
ICASSP
2009
IEEE
13 years 11 months ago
Design of robust superdirective beamformers as a convex optimization problem
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
Edwin Mabande, Adrian Schad, Walter Kellermann
CCE
2004
13 years 7 months ago
Tabu search algorithm for chemical process optimization
: This paper presents a meta-heuristic optimization algorithm, Tabu Search (TS), and describes how it can be used to solve a wide variety of chemical engineering problems. Modifica...
B. Lin, D. C. Miller
ICML
2005
IEEE
14 years 8 months ago
Building Sparse Large Margin Classifiers
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
Bernhard Schölkopf, Gökhan H. Bakir, Min...
INFOCOM
2007
IEEE
14 years 1 months ago
Randomized Decentralized Broadcasting Algorithms
— We consider the problem of broadcasting a live stream of data in an unstructured network. Broadcasting has been studied extensively for networks with capacity constraints at th...
Laurent Massoulié, Andrew Twigg, Christos G...