Difference between revisions of "Wong2004"
From ACES
(Import from BibTeX) |
m (Default pdf) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
|abstract=We have developed a new optimization paradigm for solving computationally intractable combinatorial optimization and synthesis problems. The technique, named probabilistic constructive, combines the advantages of both constructive and probabilistic optimization mechanisms. Since it is a constructive approach, it has a relatively short runtime and is amenable for the inclusion of insights through heuristic rules. The probabilistic nature facilitates a flexible tradeoff between runtime and the quality of solution, suitability for the superimposition of a variety of control strategies, and simplicity of implementation. After presenting the generic technique, we apply it to a generic NP-complete problem (maximum independent set) and a synthesis and compilation problem (sequential code covering). Extensive experimentation indicates that the new approach provides very attractive tradeoffs between the quality of solution and runtime, often outperforming the best previously published approaches. | |abstract=We have developed a new optimization paradigm for solving computationally intractable combinatorial optimization and synthesis problems. The technique, named probabilistic constructive, combines the advantages of both constructive and probabilistic optimization mechanisms. Since it is a constructive approach, it has a relatively short runtime and is amenable for the inclusion of insights through heuristic rules. The probabilistic nature facilitates a flexible tradeoff between runtime and the quality of solution, suitability for the superimposition of a variety of control strategies, and simplicity of implementation. After presenting the generic technique, we apply it to a generic NP-complete problem (maximum independent set) and a synthesis and compilation problem (sequential code covering). Extensive experimentation indicates that the new approach provides very attractive tradeoffs between the quality of solution and runtime, often outperforming the best previously published approaches. | ||
|pages=859 - 868 | |pages=859 - 868 | ||
|month= | |||
|year=2004 | |||
|volume=23 | |volume=23 | ||
|journal=IEEE Transactions of Computer Aided Designs (CAD) | |journal=IEEE Transactions of Computer Aided Designs (CAD) | ||
|title=Probabilistic Constructive Optimization Techniques | |title=Probabilistic Constructive Optimization Techniques | ||
|entry=article | |entry=article | ||
| | |pdf=Wong2004.pdf | ||
}} | }} | ||
Latest revision as of 17:40, 9 November 2021
| Wong2004 | |
|---|---|
| entry | article |
| address | |
| annote | |
| author | J. Wong and F. Koushanfar and S. Megerian and M. Potkonjak |
| booktitle | |
| chapter | |
| edition | |
| editor | |
| howpublished | |
| institution | |
| journal | IEEE Transactions of Computer Aided Designs (CAD) |
| month | |
| note | |
| number | |
| organization | |
| pages | 859 - 868 |
| publisher | |
| school | |
| series | |
| title | Probabilistic Constructive Optimization Techniques |
| type | |
| volume | 23 |
| year | 2004 |
| doi | |
| issn | |
| isbn | |
| url | |
| Wong2004.pdf | |
Email:
farinaz@ucsd.edu
farinaz@ucsd.edu
Address:
Electrical & Computer Engineering
University of California, San Diego
9500 Gilman Drive, MC 0407
Jacobs Hall, Room 6401
La Jolla, CA 92093-0407
Electrical & Computer Engineering
University of California, San Diego
9500 Gilman Drive, MC 0407
Jacobs Hall, Room 6401
La Jolla, CA 92093-0407
Lab Location: EBU1-2514
University of California San Diego
9500 Gilman Dr, La Jolla, CA 92093
University of California San Diego
9500 Gilman Dr, La Jolla, CA 92093