Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Tamir, Tami - School of Computer Science and Engineering, Interdisciplinary Center Herzliya
Scheduling with Bully Selfish Jobs In job scheduling with precedence-constraints, i j means that job j cannot start being
Semi-Matchings for Bipartite Graphs and Load Balancing
Scheduling Techniques for Media-on-Demand Amotz Bar-Noy
GreedyFilling(j) Assign in b j a cabinet for the flavor f k corresponding to R[i].
Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering
Fairness-Free Periodic Scheduling Jiri Sgall
Windows Scheduling as a Restricted Version of Bin Packing Amotz BarNoy # Richard E. Ladner + Tami Tamir +
Conflicting Congestion Effects in Resource Allocation Games Michal Feldman
A General Buffer Scheme for the Windows Scheduling Problem
A General Buffer Scheme for the Windows Scheduling Problem
Windows Scheduling as a Restricted Version of Bin AMOTZ BAR-NOY
Conflicting Congestion Effects in Resource Allocation Games
DOI: 10.1007/s004530010057 Algorithmica (2001) 29: 442467
DOI: 10.1007/s00453-006-0191-8 Algorithmica (2007) 47: 343364
DOI: 10.1007/s00453-001-0098-3 Algorithmica (2002) 32: 651678
LOCAL LABELING AND RESOURCE ALLOCATION USING PREPROCESSING #
Minimizing Makespan and Preemption Costs on a System of Uniform Machines
Real-time Scheduling with a Budget Joseph (Se) Naor 1 , Hadas Shachnai 2? , and Tami Tamir 3
Theory Comput Syst (2009) 44: 6781 DOI 10.1007/s00224-007-9029-2
Coping with Selfish On-going Behaviors Orna Kupferman Tami Tamir
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical
Journal of Artificial Intelligence Research 36 (2009) 387-414 Submitted 07/09; published 11/09 Approximate Strong Equilibrium in Job Scheduling Games
Polynomial Time Approximation Schemes Hadas Shachnai
Approximation ClassConstrained
Scheduling with Bully Selfish Jobs In job scheduling with precedence constraints, i j means that job j cannot start being
DOI: 10.1007/s00453-005-1171-0 Algorithmica (2005) 42: 309334
Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering
Windows Scheduling of Arbitrary Length Jobs on Parallel Amotz Bar-Noy
Scheduling Techniques for Media-on-Demand Amotz Bar-Noy Richard E. Ladner y Tami Tamir z
Approximation Schemes for Generalized 2-dimensional Vector Packing with Application
JOURNAL OF SCHEDULING J. Sched. 2001; 4:313338 (DOI: 10.1002/jos.086)
J Comb Optim (2010) 19: 304324 DOI 10.1007/s10878-009-9259-0
Windows Scheduling of Arbitrary Length Jobs on Multiple Amotz Bar-Noy
Algorithmica DOI 10.1007/s00453-008-9195-x
Theory Comput Syst (2012) 50:124146 DOI 10.1007/s00224-011-9336-5
