11565 search results - page 1986 / 2313 » Computing Minimal Mappings |
164
click to vote
EOR
2007
15 years 6 months ago
2007
The contribution presents a heuristic for the three-dimensional strip packing problem (3D-SPP) with rectangular pieces (boxes). The considered 3D-SPP can be formulated as follows:...
171
click to vote
EOR
2007
15 years 6 months ago
2007
In a steel tube mill where an endless stream of steel tube is supplied from a manufacturing facility, trim waste is never made regardless of cutting patterns used and the standard...
203
click to vote
EWC
2007
15 years 6 months ago
2007
This paper presents research that led to the design and implementation of fast and interactive collision detection methods that can be used to identify and report undesirable conï¬...
169
click to vote
MCS
2006
Springer
15 years 6 months ago
2006
Springer
We investigate the amount of cooperation between agents in a population during reward collection that is required to minimize the overall collection time. In our computer simulati...
195
click to vote
PAMI
2006
15 years 6 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...