Sciweavers

1118 search results - page 139 / 224
» Convex Optimization
Sort
View
MP
2002
85views more  MP 2002»
13 years 9 months ago
Generalized Goal Programming: polynomial methods and applications
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Emilio Carrizosa, Jörg Fliege
CDC
2009
IEEE
109views Control Systems» more  CDC 2009»
13 years 7 months ago
Exact solution for the max-min quantum error recovery problem
This paper considers the max-min quantum error recovery problem; the recovery channel to be designed maximizes the fidelity between input and output states of a given noisy channel...
Naoki Yamamoto
GLOBECOM
2010
IEEE
13 years 6 months ago
Design of Amplify and Forward MIMO Relay Networks with QoS Constraint
In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...
Jafar Mohammadi, Feifei Gao, Yue Rong
RECOMB
2009
Springer
14 years 9 months ago
COE: A General Approach for Efficient Genome-Wide Two-Locus Epistasis Test in Disease Association Study
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
Xiang Zhang, Feng Pan, Yuying Xie, Fei Zou, Wei Wa...
ICCAD
2002
IEEE
149views Hardware» more  ICCAD 2002»
14 years 6 months ago
Gate sizing using Lagrangian relaxation combined with a fast gradient-based pre-processing step
─ In this paper, we present Forge, an optimal algorithm for gate sizing using the Elmore delay model. The algorithm utilizes Lagrangian relaxation with a fast gradient-based pre-...
Hiran Tennakoon, Carl Sechen