A Caltech Library Service

Match Fit Algorithm - A Testbed for Computational Motivation of Attention

Billock, Joseph G. and Psaltis, Demetri and Koch, Christof (2001) Match Fit Algorithm - A Testbed for Computational Motivation of Attention. In: Computational Science - ICCS 2001. Lecture Notes in Computer Science. No.2074. Springer , Berlin, Heidelberg, pp. 208-216. ISBN 9783540422334.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
URLURL TypeDescription ReadCube access
Koch, Christof0000-0001-6482-8067
Additional Information:© Springer-Verlag Berlin Heidelberg 2001.
Group:Koch Laboratory (KLAB)
Series Name:Lecture Notes in Computer Science
Issue or Number:2074
Record Number:CaltechAUTHORS:20190829-131533840
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:98349
Deposited By: George Porter
Deposited On:30 Aug 2019 15:09
Last Modified:16 Nov 2021 17:38

Repository Staff Only: item control page