Multispace search: A new optimization approach

1. Tam-Anh Chu. Synthesis of Self-Timed VLSI Circuits from Graph-theoretic Specifications. PhD thesis, Dept. of EECS, MIT, Jun. 1987.

   Google Scholar 

2. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, 1979.

   Google Scholar 

3. F. Glover. Tabu search (I). ORSA Journal on Computing, 1(3):190–206, 1989.

   Google Scholar 

4. J. Gu. Optimization by multispace search. Technical Report UCECE-TR-90-001, Dept. of Electrical and Computer Engineering, Univ. of Calgary, Mar. 1990.

   Google Scholar 

5. J. Gu. Optimization by simulated evolution. Technical Report UCECE-TR-90-004, Dept. of Electrical and Computer Engineering, Univ. of Calgary, Mar. 1990.

   Google Scholar 

6. J. Gu and B. Du. Graph partitioning by simulated evolution. Technical Report UCECE-TR-92-001, Dept. of ECE, Univ. of Calgary, Apr. 1992.

   Google Scholar 

7. J. Gu. The UniSAT problem models (appendix). IEEE Trans. on Pattern Analysis and Machine Intelligence, 14(8):865, Aug. 1992.

   Google Scholar 

8. J. Gu. Local search for satisfiability (SAT) problem. IEEE Trans. on Systems, Man, and Cybernetics, 23(4):1108–1129, Jul./Aug. 1993.

   Google Scholar 

9. J. Gu. Global optimization for satisfiability (SAT) problem. IEEE Trans. on Knowledge and Data Engineering, 6(3):361–381, Jun. 1994.

   Google Scholar 

10. J. Gu. Optimization Algorithms for the Satisfiability (SAT) Problem. In New Advances in Optimization and Approximation. Ding-Zhu Du and Jie Sun (ed), pages 72–154. Kluwer Academic Publishers, Boston, MA, 1994.

    Google Scholar 

11. J. Gu. Constraint-Based Search. Cambridge University Press, New York, 1995.

    Google Scholar 

12. J. Gu and R. Puri. A preprocessor for satisfiability testing: A case study in asynchronous circuit synthesis. Submitted for publication, 1993.

    Google Scholar 

13. J. Gu and X. Huang. Efficient local search with search space smoothing. IEEE Trans. on Systems, Man, and Cybernetics, 24(5):727–735, May 1994.

    Google Scholar 

14. B.W. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. The Bell Systems Technical Journal, pages 291–307, Feb. 1970.

    Google Scholar 

15. S. Kirkpatrick, C.D. Gelat, and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671–680, 1983.

    Google Scholar 

16. L. Lavagno, C. Moon, R. Brayton, and A. Sangiovanni-Vincentelli. Solving the State Assignment Problem for Signal Transition Graphs. In Proceedings of 29th ACM/IEEE Design Automation Conference, pages 568–572, 1992.

    Google Scholar 

17. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons, New York, 1985.

    Google Scholar 

18. K.J. Lin and C.S. Lin. Automatic Synthesis of Asynchronous Circuits. In Proceedings of 28th ACM/IEEE Design Automation Conference, pages 296–301, 1991.

    Google Scholar 

19. P. Vanbekbergen, G. Goossens, F. Catthoor, and H. De Man. Optimized Synthesis of Asynchronous Control Circuits from Graph-Theoretic Specifications. IEEE Trans. on CAD, 11(11):1426–1438, Nov. 1992.

    Google Scholar 

20. P. Vanbekbergen, B. Lin, G. Goossens, and H. De Man. A Generalized State Assignment Theory for Transformations on Signal Transition Graphs. In Proc. International Conference on Computer-Aided Design, pages 112–117, 1992.

    Google Scholar 

Download references