Efficient algorithms for acceptable design exploration

doi:10.1145/330855.331022

Efficient algorithms for acceptable design exploration

Full Text:

PDF

Buy this Article

Authors:	Chantana Chantrapornchai	Department of Mathematics, Silpakorn University, Nakorn Pathom 73000, Thailand
	Edwin H.-M. Sha	Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN
	Xiaobo Hu	Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN

Published in:

	· Proceeding
	GLSVLSI '00 Proceedings of the 10th Great Lakes symposium on VLSI
	ACM New York, NY, USA ©2000 table of contents ISBN:1-58113-251-4 doi>10.1145/330855.331022

	2000 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 6 · Citation Count: 0

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- GLSVLSI'12

Tags: acceptable designs algorithms design design aids design aids design exploration inclusion scheduling module selections module utility

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player