<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-02-09 18:28:57Discrete geometry Packaging Bin packing problem Packing problem Heuristic function Algorithm Heuristic Bin Minkowski–Bouligand dimension Mathematics Applied mathematics Theoretical computer science |
| PDF DocumentDocID: 17pPA - View Document |
| Fractal dimensions of a green broccoli and a white cauliflower arXiv:cond-mat/0411597v1 [cond-mat.dis-nn] 24 Nov 2004 Sang-Hoon Kim∗ Division of Liberal Arts, Mokpo National Maritime University,DocID: 10Wty - View Document |
| Making Nearest Neighbors Easier Restrictions on Input Tractable solution: poly (n) preprocessing, poly log(n) search time General case of nearest neighbors seems to be intractableDocID: ZwZy - View Document |
| Microsoft Word - _agileproceedings0402.docDocID: PG7J - View Document |
| Microsoft Word - v6-1-8.docDocID: NtY8 - View Document |