648 search results - page 28 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The performance of classification algorithms in machine learning is affected by the features used to describe the labeled examples presented to the inducers. Therefore,...
EOR
2006
13 years 7 months ago
2006
A tabu search approach to solve multi-objective combinatorial optimization problems is developed in this paper. This procedure selects an objective to become active for a given it...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
MP
2002
13 years 7 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
GECCO
2009
Springer
14 years 10 days ago
2009
Springer
The Portfolio Optimization problem consists of the selection of a group of assets to a long-term fund in order to minimize the risk and maximize the return of the investment. This...