Using model dataflow graphs to reduce the storage requirements of constraints

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Bradley T. Vander Zanden University of Tennessee, Knoxville, TN
Richard Halterman University of Tennessee, Knoxville, TN
Published in:
· Journal
ACM Transactions on Computer-Human Interaction (TOCHI) TOCHI Homepage archive
Volume 8 Issue 3, September 2001
Pages 223-265
ACM New York, NY, USA
table of contents doi>10.1145/502907.502910
Using model dataflow graphs to reduce the storage requirements of constraints Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 23
· Downloads (cumulative): 511
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder