Subject Areas

3 hits in 0.006 sec.

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines [Score: 100%]
Author / Editor: Gairing, Martin; Monien, Burkhard; Woclaw, Andreas |  Place of publication: Berlin [u.a.] |  Publisher: Springer |  Year of Publication: 2005 | 12 s.
Journal / Series / Collection: Automata, languages and programming
Subject Area: Informatik
[Search within document] [PDF-Download]
Computing nash equilibria for scheduling on restricted parallel links [Score: 100%]
Author / Editor: Gairing, Martin; Monien, Burkhard |  Place of publication: New York, NY |  Publisher: Association for Computing Machinery |  Year of Publication: 2004 | 10 s.
Journal / Series / Collection: Proceedings of the 36th ACM Symposion on Theory of Computing, Chicago, Ill., June 13-15,2004
Subject Area: Informatik
[Search within document] [PDF-Download]
Selfish routing with incomplete information [Score: 100%]
Author / Editor: Gairing, Martin; Monien, Burkhard; Tiemann, Karsten |  Place of publication: New York, NY |  Publisher: Association for Computing Machinery |  Year of Publication: 2005 | 10 s.
Journal / Series / Collection: SPAA 2005 : Seventeenth Annual ACM Symposium on parallelism in algorithms and architectures, July 18-20, 2005, Las Vegas, Nevada, USA
Subject Area: Informatik
[Search within document] [PDF-Download]

Active filters [Remove filter]

Drill down result

Subject Area

Year of Publication