๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the fourteenth annual ACM symposium - Winnipeg, Manitoba, Canada (2002.08.10-2002.08.13)] Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02 - Nearest common ancestors

โœ Scribed by Alstrup, Stephen; Gavoille, Cyril; Kaplan, Haim; Rauhe, Theis


Book ID
125456552
Publisher
ACM Press
Year
2002
Tongue
English
Weight
183 KB
Category
Article
ISBN-13
9781581135299

No coin nor oath required. For personal study only.

โœฆ Synopsis


Sponsored By Acm Sigact [and] Acm Sigarch In Cooperation With Eatcs. Acm Order Number: 417020--t.p. Verso. Includes Bibliographical References And Author Index. Also Available On The World Wide Web Via Acm Digital Library With Title: Proceedings Of The Fourteenth Annual Acm Symposium On Parallel Algorithms And Architectures, 2002.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press the fourteenth annual ACM sym
โœ Chlebus, Bogdan S.; Kowalski, Dariusz R. ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› ACM Press ๐ŸŒ English โš– 232 KB

Sponsored By Acm Sigact [and] Acm Sigarch In Cooperation With Eatcs. Acm Order Number: 417020--t.p. Verso. Includes Bibliographical References And Author Index. Also Available On The World Wide Web Via Acm Digital Library With Title: Proceedings Of The Fourteenth Annual Acm Symposium On Parallel Alg

[ACM Press the fourteenth annual ACM sym
โœ Bagchi, Amitabha; Chaudhary, Amitabh; Scheideler, Christian; Kolman, Petr ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› ACM Press ๐ŸŒ English โš– 250 KB

Sponsored By Acm Sigact [and] Acm Sigarch In Cooperation With Eatcs. Acm Order Number: 417020--t.p. Verso. Includes Bibliographical References And Author Index. Also Available On The World Wide Web Via Acm Digital Library With Title: Proceedings Of The Fourteenth Annual Acm Symposium On Parallel Alg

[ACM Press the eighteenth annual ACM sym
โœ Plaxton, C. Greg; Sun, Yu; Tiwari, Mitul; Vin, Harrick ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› ACM Press ๐ŸŒ English โš– 242 KB

We consider a class of scheduling problems that we refer to as reconfigurable resource scheduling. This class of problems is motivated by emerging applications that involve dynamically allocating a large number of shared resources to a variety of services. We design efficient online algorithms for c

[ACM Press the eighteenth annual ACM sym
โœ Bunde, David P. ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› ACM Press ๐ŸŒ English โš– 166 KB

We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the mu