Value-density algorithms for the deliberation-scheduling problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Yagíl Ronén
Daniel Mossé
Martha E. Pollack
Published in:
Cover Image
 
· Newsletter
ACM SIGART Bulletin Homepage archive
Volume 7 Issue 2, April 1996
Pages 41-49
ACM New York, NY, USA
table of contents doi>10.1145/242587.242598
Value-density algorithms for the deliberation-scheduling problem Published by ACM 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 2
· Downloads (cumulative): 98
· 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