Probabilistic constructive optimization techniques

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 23, Issue 6, 2004, Pages 859-868

  Wong, Jennifer L ^a   Koushanfar, Farinaz ^b   Megerian, Seapahn ^c   Potkonjak, Miodrag ^a  

^a Engineering IV   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Graph coloring; Maximum independent set; Optimization algorithm; Sequence covering

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBABILITY; SET THEORY;

GRAPH COLORING; MAXIMUM INDEPENDENT SETS; OPTIMIZATION ALGORITHMS; SEQUENCE COVERING;

SOFTWARE ENGINEERING;

EID: 2942521202     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2004.828136     Document Type: Article

References (37)

1. G. D. Micheli, Synthesis and Optimization of Digital Circuits. New York: McGraw-Hill, 1994.
2. J. K. P. G. Paulin, "Force-directed scheduling for the behavioral synthesis of asics," IEEE Trans. Computer-Aided Design, vol. 8, pp. 661-679, June 1989.
3. K. Keutzer, "Dagon: Technology binding and local optimization," in Proc. ACM/IEEE Design Automation Conf., 1987, pp. 341-347.
4. B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell Syst. Tech. J., vol. 49, no. 2, pp. 291-308, 1970.
5. S. Kirkpatrick, C. Gelatt, and M. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
6. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, "Optimization by simulated annealing: An experimental evaluation, part II, graph coloring and number partitioning," Oper. Res., vol. 39, no. 3, pp. 378-406, 1991.
7. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
8. J. L. Wong, F. Koushanfar, S. Megerian, and M. Potkonjak, "Probabilistic constructive optimization techniques," Univ. of California, Los Angeles, Tech. Rep. TR030 049, 2003.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. New York: McGraw-Hill, 1990.
10. C. Brassard and P. Bratley, Algorithmics: Theory and Practice. Englewood Cliffs, NJ: Prentice Hall, 1988.
11. F. Gavril, "Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph," SIAM J. Comput., vol. 1, no. 2, pp. 180-187, 1972.
12. C. A. R. Hoare, "Quicksort," Comput. J., vol. 5, no. 1, pp. 10-15, 1962.
13. N. Metropolis, A. Rosenbluth, R. Rosenbluth, A. Teller, and E. Teller, "Equation of state calculations by fast computing machines," J. Chem. Phys., vol. 21, pp. 1087-1092, 1953.
14. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. New York: Wiley, 1989.
15. D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
16. L. Fogel, A. Owens, and M. Walsh, Artificial Intelligence Through Simulated Evolution. New York: Wiley, 1966.
17. F. Clover, "Tabu search part I," J. Comput., vol. 1, no. 3, pp. 190-206, 1989.
18. R. Tarjan and A. Trojanowski, "Finding a maximum independent set," SIAM J. Comput., vol. 6, no. 3, pp. 537-546, 1977.
19. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W. H. Freeman, 1979.
20. O. Coudert, "Exact coloring of real-life graphs is easy," in Proc. ACM/IEEE Design Automation Conf., 1997, pp. 121-126.
21. D. Joseph, J. Meidanis, and P. Tiwari, "Determining DNA sequence similarity using maximum independent set algorithms for interval graphs," in Proc. Algorithm Theory - SWAT, 1992, pp. 326-337.
22. A. Juels and M. Peinado, "Hiding cliques for cryptographic security," Designs, Codes Cryptog., vol. 20, no. 3, pp. 269-280, 2000.
23. R. Karp and A. Wigderson, "A fast parallel algorithm for the maximal independent set problem," J. ACM, vol. 32, no. 4, pp. 762-773, 1985.
24. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, "The maximum clique problem," in Handbook of Combinatorial Optimization. Norwell, MA: Kluwer, 1999, vol. 4, pp. 1-74.
25. L. Babel and G. Tinhofer, "A branch and bound algorithm for the maximum clique problem," ZOR-Methods Models Oper. Res., vol. 34, no. 3, pp. 207-217, 1990.
26. C. Hoffman and M. O'Donnell, "Pattern matching in trees," J. ACM, vol. 29, no. 1, pp. 68-95, 1982.
27. A. Aho, M. Ganapathi, and S. Tjiang, "Code generation using tree matching and dynamic programming," ACM Trans. Program. Lang. Syst., vol. 11, no. 4, pp. 491-516, 1989.
28. F. Catthoor, G. Goossens, and H. D. Man, "Combined hardware selection and pipelining in high-performance data-path design," IEEE Trans. Computer-Aided Design, vol. 11, pp. 413-423, Apr. 1992.
29. D. Rao and F. Kurdahi, "On clustering for maximal regularity extraction," IEEE Trans. Computer-Aided Design, vol. 12, pp. 1198-1208, Aug. 1993.
30. G. Qu, N. Kawabe, K. Usami, and M. Potkonjak, "Function-level power estimation methodology for microprocessors," in Proc. ACM/IEEE Design Automation Conf., 2000, pp. 810-813.
31. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving. Reading, MA: Addison-Wesley, 1984.
32. S. J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach. Englewood Cliffs, NJ: Prentice Hall, 1995.
33. H. Massalin, "Superoptimizer - A look at the smallest program," in Proc. Architec. Support Program. Lang. Oper. Syst., 1987, pp. 122-126.
34. M. Corazao, M. Khalaf, L. Guerra, M. Potkonjak, and J. Rabaey, "Performance optimization using template mapping for datapath-intensive high-level synthesis," IEEE Trans. Computer-Aided Design, vol. 15, pp. 877-888, Aug. 1996.
35. D. Kirovski, Y.-Y. Hwang, M. Potkonjak, and J. Cong, "Intellectual property protection by watermarking combinational logic synthesis solutions," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, 1998, pp. 194-198.
36. J. Cong, M. Hossain, and N. Sherwani, "A probably good multilayer topological planar routing algorithm in IC layout designs," IEEE Trans. Computer-Aided Design, vol. 12, pp. 70-78, Jan. 1993.
37. DIMACS.. DIMACS. [Online] Available: http://dimacs.rutgers.edu