The following pages link to Tami Tamir (Q249088):
Displaying 50 items.
- (Q172560) (redirect page) (← links)
- 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)
- The efficiency of best-response dynamics (Q681867) (← 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)
- A game theoretical approach for VLSI physical design placement (Q2086446) (← links)
- Equilibrium inefficiency in resource buying games with load-dependent costs (Q2109949) (← links)
- Race scheduling games (Q2109966) (← links)
- The power of one evil secret agent (Q2196556) (← links)
- Paging with request sets (Q2272199) (← links)
- Windows scheduling of arbitrary-length jobs on multiple machines (Q2434274) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- (Q2753744) (← links)
- Load Rebalancing Games in Dynamic Systems with Migration Costs (Q2856133) (← links)
- A Theory and Algorithms for Combinatorial Reoptimization (Q2894503) (← links)
- Minimizing Busy Time in Multiple Machine Real-time Scheduling (Q2908847) (← links)
- Resource Allocation Games with Multiple Resource Classes (Q2971166) (← links)
- (Q3044356) (← links)
- Coping with Selfish On-Going Behaviors (Q3066115) (← links)
- From Reachability to Temporal Specifications in Cost-Sharing Games (Q3192177) (← links)
- Properties and Utilization of Capacitated Automata (Invited Talk) (Q3299222) (← links)
- (Q3301024) (← links)
- Hierarchical Network Formation Games (Q3303895) (← links)
- Cost-Sharing Scheduling Games on Restricted Unrelated Machines (Q3449583) (← links)
- Minimal Cost Reconfiguration of Data Placement in Storage Area Network (Q3558929) (← links)
- Windows scheduling as a restricted version of bin packing (Q3580939) (← links)
- Approximate Strong Equilibrium in Job Scheduling Games (Q3651490) (← links)
- Local Labeling and Resource Allocation Using Preprocessing (Q4268716) (← links)
- (Q4411417) (← links)
- (Q4449246) (← links)
