See this document in CiteSeerX!

Probabilistic Control Search Strategies For Hardware And Software Optimization During Solution Space Exploration  (Make Corrections)  
Jennifer L. Wong, Farinaz Koushanfar, Seapahn Meguerdichican, Advait Morge, Dusan Petranovic, Miodrag Potkonjak



  Home/Search   Context   Related

 
View or download:
ucla.edu/~miodrag/papers/PACO01.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ucla.edu/~miodrag/papers/ (more)
Homepages:  J.Wong  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In the last several years, system and integrated circuits (IC) semiconductor industry and research has started refocusing from the general purpose computing platform toward application specific devices and appliances. This shift, compounded with the exponentially growing gap between IC potential and design productivity imposes an urgent need for new design methodologies and technologies. There are four main phases in development of application specific systems (ASS): algorithm, architecture,... (Update)

Active bibliography (related documents):   More   All
1.7:   A Probabilistic Constructive Approach To Optimization.. - Wong, Koushanfar.. (2001)   (Correct)
0.9:   MetaCores: Design and Optimization Techniques - Seapahn Meguerdichian Farinaz (2001)   (Correct)
0.8:   Concurrent Algorithm Development and Software.. - Kirovski, Potkonjak   (Correct)

Similar documents based on text:   More   All
0.6:   Coverage Problems in Wireless Ad-hoc Sensor Networks - Meguerdichian, Koushanfar, .. (2001)   (Correct)
0.5:   ILP-Based Engineering Change - Koushanfar, Wong, Feng, Potkonjak (2002)   (Correct)
0.5:   Exposure In Wireless Ad-Hoc Sensor Networks - Meguerdichian, Koushanfar, Qu, .. (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ wong-probabilistic,
  author = "Jennifer L. Wong and Farinaz Koushanfar and Seapahn Meguerdichican and
    Advait Morge and Dusan Petranovic and Miodrag Potkonjak",
  title = "Probabilistic Control Search Strategies For Hardware And Software Optimization
    During Solution Space Exploration",
  url = "citeseer.ist.psu.edu/502486.html" }
Citations (may not include all citations):
4212   Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
643   Equation of state calculations by fast computing machines (context) - Metropolis, Rosenbluth et al. - 1953
518   Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988
443   Discrete-time Signal Processing (context) - Oppenheim, Shafer - 1989
429   An Efficient Heuristic Procedure for Partitioning Graphs (context) - Kernighan, Lin - 1970
421   A Linear Time Heuristic for Improving Network Partitions (context) - Fiduccia, Mattheyses - 1982
371   Optimization by simulated annealing: An experimental evaluat.. (context) - Johnson, Aragon et al. - 1991
312   Tabu search part (context) - Glover - 1989
266   Heuristics: Intelligent Search Strategies for Computer Probl.. (context) - Pearl - 1984
245   Artificial Intelligence through Simulated Evolution (context) - Fogel, Owens et al. - 1966
210   Minimizing conflicts: a heuristic repair method for constrai.. - Minton, Johnston et al. - 1992
163   Application of Theorem Proving to Problem Solving (context) - Green - 1969
158   A formal basis for the heuristic determination of minimum co.. (context) - Hart, Nilsson et al. - 1968
154   The traveling salesman problem and minimum spanning trees: P.. (context) - Held, Karp - 1971
153   Graph Coloring Problems (context) - Jensen, Toft - 1995
133   Adaptation in natural and artificial systems: an introductor.. (context) - Holland - 1975
121   Recent Directions in Netlist Partitioning: A Survey (context) - Alpert, Kahng - 1995
114   Fast prototyping of datapath-intensive architectures (context) - Rabaey, Chu et al. - 1991
112   New methods to color the vertices of a graph (context) - Brelaz - 1979
102   Computer solutions of the traveling salesman problem (context) - Lin - 1965
100   Branch-and-bound methods: A survey (context) - Lawler, Wood - 1966
99   Approximate graph coloring by semi-definite programming - Karger, Motwani et al. - 1998
93   Simulated Annealing and Boltzmann Machines: a stochastic app.. (context) - Aarts, Korst - 1989
78   An improved min-cut algorithm for partitioning VLSI networks (context) - Krishnamurthy - 1984
77   Multiple-way network partitioning (context) - Sanchis - 1989
64   Testing embedded-core-based system chips - Zorian, Marinissen et al. - 1999
63   Optimisation by Simulated Annealing (context) - Kirkpatrick, Gelatt et al. - 1983
56   Backtrack programming techniques (context) - Bitner, Reingold - 1975
45   Search rearrangement backtracking and polynomial average tim.. (context) - Purdom - 1983
38   Power Estimation for High Level Synthesis (context) - Landman, Rabaey - 1993
32   Program Developments: Formal Explanations of Implementations (context) - Wile - 1983
32   New York: McGraw-Hill (context) - De Micheli, optimization et al. - 1994
29   Interconnect delay estimation models for synthesis and desig.. - Cong, Pan - 1999
29   Estimating implementation bounds for real time DSP applicati.. (context) - Rabaey, Potkonjak - 1994
29   An experimental program transformation and synthesis system (context) - Darlington - 1981
26   Some Experiments with Simulated Annealing for Coloring Graph.. (context) - Chams, Hertz et al. - 1987
22   Memory Estimation for High Level Synthesis (context) - Verbauwhede, Scheers et al. - 1994
17   Synthesis by Completion (context) - Dershowitz - 1985
16   Exact coloring of real-life graphs is easy - Coudert - 1997
15   Wave digital filters: theory and practice (context) - Fettweis - 1986
15   Machine discovery of effective admissible heuristics (context) - Prieditis - 1993
12   Efficient coloring of a large spectrum of graphs - Kirovski, Potkonjak - 1998
12   Synthesis of minimum roundoff noise fixed point digital filt.. (context) - Mullis, Roberts - 1976
11   Symbolic and Knowledge-based Signal Processing (context) - Oppenheim, Nawab - 1992
10   Experiments With The Graph Traverser Program (context) - Doran, Michie - 1966
10   Approximating the minimum maximal independence number (context) - Halldorsson - 1993
10   Digital lattice and ladder filter synthesis (context) - Jr, Markel - 1973
9   Orthogonal digital filters for VLSI implementation (context) - Rao, Kailath - 1984
9   On wireless spectrum estimation and generalized graph colori.. - Khanna, Kumaran - 1998
9   New results in the design of digital interpolators (context) - Oetken, Parks et al. - 1975
8   Chromatic Number Approximation Using Simulated Annealing (context) - Morgenstern, Shapiro - 1986
7   A Graph Coloring Algorithm for Large Scheduling Algorithms (context) - Leighton - 1979
7   Hardware reuse at the behavioral level - Schaumont, Cmar et al. - 1999
6   TABARIS: an exact algorithm based on Tabu search for finding.. (context) - Friden, Hertz et al. - 1990
5   A Genetic Approach for Maximum Independent Set Problems (context) - Sakamoto, Liu et al. - 1997
5   Virtual simulation of distributed IP-based designs (context) - Delpasso, Bogliolo et al. - 1999
5   Practical and theoretical considerations in heuristic search.. (context) - Pohl - 1977
4   A provably good multilayer topological planar routing algori.. - Cong, Hossain et al. - 1993
4   A graph-coloring result and its consequences for polygon-gua.. (context) - Hoffmann, Kriegel - 1996
3   Digital filters with equiripple or minimax responses (context) - Helms - 1971
3   Algorithm selection: a quantitative optimization-intensive a.. (context) - Potkonjak, Rabaey - 1999
3   A Probabilistic Constructive Approach To Optimization Proble.. - Wong, Koushanfar et al. - 2001
3   Neural Networks and Physical Systems with Convergent Collect.. (context) - Hopfield - 1982
3   Time domain design of recursive digital filters (context) - Burrus, Parks - 1970
2   Using node merging to enhance graph coloring (context) - Vegdahl - 1999
2   A graph coloring based approach for self-checking logic circ.. (context) - Busaba, Lala - 1995
2   Some comparisons between FIR and IIR digital filters (context) - Rabiner, Kaiser et al. - 1974
2   A general family of multivariable digital lattice filters (context) - Vaidyanathan, Mitra - 1985
2   The search for generality (context) - Newell, Ernst - 1965
2   Canonic realizations of digital filters using the continued .. (context) - Mitra, Sherwood - 1972
1   An FPGA implementation of GENET for solving graph coloring p.. - Lee, Leong et al. - 1998
1   MetaCores: design and optimization techniques - Meguerdichian, Koushanfar et al. - 2001
1   of Computer Science at The University of Utah (context) - Algorithms, Very et al. - 1989
1   Circuit clustering using graph coloring (context) - Singh, Marek-Sadowska - 1999
1   Performance evaluation of a graph coloring based load balanc.. (context) - Joshi, Hosseini et al. - 1995
1   FormalDerivationofasystolicarrayfor recursive least squares .. (context) - Proudler, McWhirter et al. - 1996
1   Graph coloring via synchronization of coupled oscillators (context) - Wu - 1998
http://www.cadence.com/eda_solutions/
http://www.mathworks.com/

Documents on the same site (http://www.cs.ucla.edu/~miodrag/papers/):   More
FPGA Fingerprinting Techniques for Protecting.. - Lach, Mangione-Smith, .. (1998)   (Correct)
Analysis of Watermarking Techniques for Graph Coloring Problem - Qu, Potkonjak (1998)   (Correct)
Behavioral-Level Synthesis of Heterogeneous BISR.. - Guerra, Potkonjak.. (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC