4266 search results - page 108 / 854 » The container loading problem |
131
click to vote
CAEPIA
2003
Springer
15 years 7 months ago
2003
Springer
This paper describes a time-series prediction method based on the kNN technique. The proposed methodology is applied to the 24hour load forecasting problem. Also, based on recorded...
110
click to vote
CASES
2003
ACM
15 years 6 months ago
2003
ACM
Processors such as StrongARM and memory such as SDRAM enable efficient execution of multiple loads and stores in a single instruction. This is particularly useful in connection wi...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
114
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
116
click to vote
JAIR
2007
15 years 2 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...