References

1

BARMAK, B. Routing in data networks using simulated annealing. Master's thesis, MIT Department of Mechanical Engineering, Jan. 1987.

2

CERNý, V. A thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications 45, 1 (Jan. 1985), 41-51.

3

CHUANG, I. L. Computational origami. Aug. 1988.

4

CHUANG, I. L. An introduction to the application of computational origami. Feb. 1989.

5

CHUANG, I. L. A computational origami architecture time slot interchanger. Tech. rep., AT&TBell Laboratories, Feb. 1990.

6

CHUANG, I. L., AND FRENCH, R. S. Karma I: An origami architecture computer. Dec. 1988.

7

COHOON, J. P., AND PARIS, W. D. Genetic placement. In Proceedings IEEE International Conference on Computer-Aided Design (1986), pp. 422-425.

8

DAVIS, L., Ed. Genetic Algorithms and Simulated Annealing. Morgan Kaufmann Publishers, 1987.

9

FLEISHER, H., GIRALDI, J., MARTIN, D. B., PHOENIX, R. L., AND TAVEL, M. A. Simulated annealing as a tool for logic optimization in a CAD environment. In Proceedings IEEE International Conference on Computer-Aided Design (1985), pp. 203-205.

10

FRENCH, R. S. A simple placement and routing algorithm for a two-dimensional computational origami architecture. In Papers of the MIT-ACM Undergraduate Computer Science Conference (Apr. 1989).

11

GOLDBERG, D. E. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.

12

GROVER, L. K. A new simulated annealing algorithm for standard cell placement. In Proceedings IEEE International Conference on Computer-Aided Design (1986), pp. 378-380.

13

HOUH, H. H., N. A. WHITAKER, J., AND CHUANG, I. L. Implementation of an arbitrary finite state machine using a handful of logic gates. Tech. rep., AT&TBell Laboratories, Nov. 1989.

14

HUANG, A. Architectural considerations involved in the design of an optical digital computer. Proceedings of the IEEE 72, 7 (July 1984), 780-786.

15

HUANG, A. Computational origami. Patent application, July 1987.

16

HUANG, A. Computational origami - the folding of circuits and systems. In Proceedings of the 1989 Optical Computing Conference (Feb. 1989). To appear.

17

KIRKPATRICK, S., GELATT, JR., C. D., AND VECCHI, M. P. Optimization by simulated annealing. Science 220, 4598 (May 1983), 671-680.

18

LINTON, M. A., CALDER, P. R., AND VLISSIDES, J. M. Interviews: A C++ graphical interface toolkit. Tech. rep., Stanford University, July 1988. CSL-TR-88-358.

19

LU, H. Computational origami: A geometric approach to regular multiprocessing. Master's thesis, MIT Department of Electrical Engineering and Computer Science, May 1988.

20

SECHEN, C. VLSI Placement and Global Routing using Simulated Annealing. Kluwer Academic Publishers, 1988.

21

STROUSTRUP, B. The C++ Programming Language. Addison-Wesley, Reading, MA, 1986.

22

VECCHI, M. P., AND KIRKPATRICK, S. Global wiring by simulated annealing. IEEE Transactions on Computer-Aided Design CAD-2, 4 (Oct. 1983), 215-222.

23

VLISSIDES, J. M., AND LINTON, M. A. Applying object-oriented design to structures graphics. In Proceedings of the 1988 USENIX C++ Conference (Oct. 1988), pp. 81-94.

24

WALBRIDGE, C. T. Genetic algorithms: What computers can learn from Darwin. Technology Review (Jan. 1989), 47-53.

25

WONG, D. F., LEONG, H. W., AND LIU, C. L. Simulated Annealing for VLSI design. Kluwer Academic Publishers, 1988.