ACM Home Page
Please provide us with feedback. Feedback
Stochastic sequential machine synthesis targeting constrained sequence generation
Full text PdfPdf (82 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 33rd annual Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 696 - 701  
Year of Publication: 1996
ISBN:0-89791-779-0
Authors
Diana Marculescu  Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, CA
Radu Marculescu
Massoud Pedram  Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, CA
Sponsors
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Citation Count: 11
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/240518.240650
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
4
5
 
6
C.S.Ding, M. Pedram, 'Tagged Probabilistic Simulation Provides Accurate and Efficient Power Estimates at Gate Level', in Proc. of the Symposium on Low Power Electronics, pp.42-43, Sept. 1995.
7
 
8
D. Marculescu, R. Marculescu, and M. Pedram, 'Vector Compaction Using Probabilistic Automata', Technical Report, Univ. of Southern California, March 1996.
9
 
10
J. Von Neumann, 'Probabilistic Logics and Synthesis of reliable organisms from unreliable components', in Annals of Mathematics Studies, Vol.34, pp.43-98, Princeton Univ. Press, Princeton, New Jersey 1956.
 
11
A. Davis, 'Markov Chains as Random Input Automata', in American Mathematical Monthly, Vol.68, pp. 264-267, 1961.
 
12
M. Rabin, 'Probabilistic Automata', in Information and Control, Vol.6, pp. 230-245, 1963.
 
13
 
14
B. Kernighan and S. Lin, 'An Efficient Heuristic Procedure for Partitioning Graphs', in Bell Systems Technical Journal, Vol.49, No.2, pp.291-307, 1970.
 
15
 
16

CITED BY  11

Collaborative Colleagues:
Diana Marculescu: colleagues
Radu Marculescu: colleagues
Massoud Pedram: colleagues