8647 search results - page 425 / 1730 » The Container Selection Problem |
126
Voted
CP
2006
Springer
15 years 8 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
124
click to vote
AIPS
2004
15 years 6 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
175
click to vote
SPIRE
2010
Springer
15 years 3 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
176
Voted
JMLR
2011
14 years 12 months ago
2011
We propose a framework MIC (Multiple Inclusion Criterion) for learning sparse models based on the information theoretic Minimum Description Length (MDL) principle. MIC provides an...
134
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...