8647 search results - page 195 / 1730 » The Container Selection Problem |
109
Voted
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
We solve the Flexible Job-Shop Problem (FJSP) by using dispatching rules discovered through Genetic Programming (GP). While Simple Priority Rules (SPR) have been widely applied in ...
177
click to vote
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
105
Voted
INFORMATICALT
2002
15 years 3 months ago
2002
This article presents the ways of identification, selection and transformation of the data into other structures. Relation selection and transformation may change data quantity and...
95
Voted
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. This paper presents a simple and practical solution to the 6-point 2view focal-length estimation problem. Based on the hidden-variable technique we have derived a 15th de...
127
Voted
AUSAI
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...