8647 search results - page 104 / 1730 » The Container Selection Problem |
128
Voted
ICCBR
2005
Springer
15 years 8 months ago
2005
Springer
Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes r...
106
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
119
click to vote
AAAI
2012
13 years 5 months ago
2012
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
EOR
2006
15 years 2 months ago
2006
We consider multi-period portfolio selection problems for a decision maker with a specified utility function when the variance of security returns is described by a discrete time ...
152
click to vote
JMLR
2010
14 years 9 months ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...