Advertisement

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

  • Joseph G. Billock
  • Demetri Psaltis
  • Christof Koch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2074)

Abstract

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.

References

  1. 1.
    Izumi, T., Yokomaru, T., Takahashi, A., Kajitani, Y.: Computational complexity analysis of Set-Bin-Packing problem. IEICE Transactions on Fundamentals Of Electronics Communications and Computer Sciences: 5 (1998) 842–849Google Scholar
  2. 2.
    Garey, M. R., Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA. (1979)zbMATHGoogle Scholar
  3. 3.
    Karp, R. M.: Reducibility Among Combinatorial Problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher eds. Plenum Press, NY. 1972 85–104Google Scholar
  4. 4.
    Johnson, D. S.: Fast Algorithms for Bin-Packing. Journal of Computer Systems Science 8 (1974) 272–314zbMATHGoogle Scholar
  5. 5.
    Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., Graham, R. L.: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. SIAM Journal of Computing 3 (1974) 299–326CrossRefMathSciNetGoogle Scholar
  6. 6.
    Mao, W.: Tight Worst-case Performance Bounds for Next-k-Fit Bin Packing. SIAM Journal on Computing 22(1) (1993) 46–56CrossRefMathSciNetGoogle Scholar
  7. 7.
    Falkenauer, E.: A Hybrid Grouping Genetic Algorithm for Bin Packing. Working paper CRIF Industrial Management and Automation, CP 106-P4, 50 av. F. D.Roosevelt, B-1050 Brussels, Belgium. (1996)Google Scholar
  8. 8.
    Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic ‘phase transitions’. Nature 400(6740) (1999) 133–137CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Joseph G. Billock
    • 1
  • Demetri Psaltis
    • 1
  • Christof Koch
    • 1
  1. 1.California Institute of TechnologyPasadenaUSA

Personalised recommendations