Domination analysis for scheduling on non preemptive uniformly related machines

Abstract : no abstract
Type de document :
Communication dans un congrès
Broutin, Nicolas and Devroye, Luc. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), pp.81-82, 2012, DMTCS Proceedings
Liste complète des métadonnées

https://hal.inria.fr/hal-01197235
Contributeur : Coordination Episciences Iam <>
Soumis le : vendredi 11 septembre 2015 - 12:54:56
Dernière modification le : mardi 7 mars 2017 - 15:18:05
Document(s) archivé(s) le : mardi 29 décembre 2015 - 00:34:35

Fichier

dmAQ0107.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01197235, version 1

Collections

Citation

Idan Eisner, Alek Vainshtein. Domination analysis for scheduling on non preemptive uniformly related machines. Broutin, Nicolas and Devroye, Luc. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), pp.81-82, 2012, DMTCS Proceedings. 〈hal-01197235〉

Partager

Métriques

Consultations de la notice

186

Téléchargements de fichiers

44