( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering.

, , и . SIROCCO, том 4056 из Lecture Notes in Computer Science, стр. 171-181. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Berhan Tamir

Dereje Tamiru

Elias Tamiru

Tamiru Negash Alkie

Jamshid Tamiry

 

Другие публикации лиц с тем же именем

Properties and Utilization of Capacitated Automata (Invited Talk)., и . FSTTCS, том 29 из LIPIcs, стр. 33-44. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)On Chromatic Sums and Distributed Resource Allocation., , и . ISTCS, стр. 119-128. IEEE Computer Society, (1996)A Theory and Algorithms for Combinatorial Reoptimization., , , и . Algorithmica, 80 (2): 576-607 (2018)Transactional Contention Management as a Non-Clairvoyant Scheduling Problem., , , и . Algorithmica, 57 (1): 44-61 (2010)Network-Formation Games with Regular Objectives., , и . FoSSaCS, том 8412 из Lecture Notes in Computer Science, стр. 119-133. Springer, (2014)Real-Time Scheduling with a Budget., , и . ICALP, том 2719 из Lecture Notes in Computer Science, стр. 1123-1137. Springer, (2003)Approximation Schemes for Packing with Item Fragmentation., , и . WAOA, том 3879 из Lecture Notes in Computer Science, стр. 334-347. Springer, (2005)All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns., , , , , , , и . ACM Trans. Algorithms, 12 (3): 38:1-38:25 (2016)Minimizing Makespan and Preemption Costs on a System of Uniform Machines., , и . Algorithmica, 42 (3-4): 309-334 (2005)Minimizing total busy time in parallel scheduling with application to optical networks., , , , , , и . Theor. Comput. Sci., 411 (40-42): 3553-3562 (2010)