1389 search results - page 212 / 278 » Improved Approximation Algorithms for Label Cover Problems |
127
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
119
click to vote
SIGIR
2006
ACM
15 years 8 months ago
2006
ACM
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
108
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Feature extraction is a process that extracts salient features from observed variables. It is considered a promising alternative to overcome the problems of weight and structure o...
115
click to vote
COMPUTING
2010
15 years 7 days ago
2010
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
135
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...