139 search results - page 21 / 28 » A Grid-enabled Branch and Bound Algorithm for Solving Challe... |
JCSS
2008
13 years 7 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
AB
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
DISOPT
2008
13 years 7 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...