840 search results - page 48 / 168 » Inapproximability of Combinatorial Optimization Problems |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
MP
2011
13 years 6 months ago
2011
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
JPDC
2006
13 years 11 months ago
2006
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
BMCBI
2006
13 years 11 months ago
2006
Background: Discovery of precise specificity of transcription factors is an important step on the way to understanding the complex mechanisms of gene regulation in eukaryotes. Rec...
FGCS
2000
13 years 10 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...