8647 search results - page 140 / 1730 » The Container Selection Problem |
120
Voted
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Classifier learning methods commonly assume that the training data consist of randomly drawn examples from the same distribution as the test examples about which the learned model...
120
click to vote
EVOW
2004
Springer
15 years 8 months ago
2004
Springer
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to ...
161
click to vote
IPCO
2008
15 years 4 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
115
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...