The following pages link to Tami Tamir (Q249088):
Displaying 26 items.
- Cost-sharing scheduling games on restricted unrelated machines (Q306273) (← links)
- Network-formation games with regular objectives (Q342715) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
- Tight bounds for online class-constrained packing (Q596145) (← links)
- Minimal cost reconfiguration of data placement in a storage area network (Q690477) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
- Minimizing makespan and preemption costs on a system of uniform machines (Q818662) (← links)
- Transactional contention management as a Non-clairvoyant scheduling problem (Q848634) (← links)
- Real-time scheduling with a budget (Q878439) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- Approximation schemes for packing with item fragmentation (Q927410) (← links)
- Optimal delay for media-on-demand with pre-loading and pre-buffering (Q930897) (← links)
- Algorithms for storage allocation based on client preferences (Q975763) (← links)
- Scheduling techniques for media-on-demand (Q1018046) (← links)
- Periodic scheduling with obligatory vacations (Q1034630) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Multiprocessor scheduling with machine allotment and parallelism constraints (Q1348915) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Semi-matchings for bipartite graphs and load balancing (Q5491460) (← links)
- On two class-constrained versions of the multiple knapsack problem (Q5930158) (← links)
- Load rebalancing games in dynamic systems with migration costs (Q5964072) (← links)
