Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 2001 | Published
Book Section - Chapter Open

The Match Fit Algorithm - A Testbed for Computational Motivation of Attention


We present an assessment of the performance of a new on-line bin packing algorithm, which can interpolate smoothly from the Next Fit to Best Fit algorithms, as well as encompassing a new class of heuristic which packs multiple blocks at once. The performance of this novel O(n) on-line algorithm can be better than that of the Best Fit algorithm. The new algorithm runs about an order of magnitude slower than Next Fit, and about two orders of magnitude faster than Best Fit, on large sample problems. It can be tuned for optimality in performance by adjusting parameters which set its working memory usage, and exhibits a sharp threshold in this optimal parameter space as time constraint is varied. These optimality concerns provide a testbed for the investigation of the value of memory and attention-like properties to algorithms.

Additional Information

© Springer-Verlag Berlin Heidelberg 2001.

Attached Files

Published - 3-540-45718-6_23.pdf


Files (147.0 kB)
Name Size Download all
147.0 kB Preview Download

Additional details

September 28, 2023
October 24, 2023