Stebėti
Tami Tamir
Tami Tamir
Professor of Computer Science, The Interdisciplinary Center (IDC)
Patvirtintas el. paštas idc.ac.il - Pagrindinis puslapis
Pavadinimas
Cituota
Cituota
Metai
Polynomial time approximation schemes
H Shachnai, T Tamir
Handbook of Approximation Algorithms and Metaheuristics, 125-156, 2018
594*2018
Automatic extraction of metadata using a neural network
O Shmueli, D Greig, C Staelin, T Tamir
US Patent 6,044,375, 2000
2322000
On chromatic sums and distributed resource allocation
A Bar-Noy, M Bellare, MM Halldórsson, H Shachnai, T Tamir
Information and Computation 140 (2), 183-202, 1998
2141998
Maximizing submodular set functions subject to multiple linear constraints
A Kulik, H Shachnai, T Tamir
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
2122009
Beyond VCG: Frugality of truthful mechanisms
AR Karlin, D Kempe, T Tamir
Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium …, 2005
1402005
Semi-matchings for bipartite graphs and load balancing
NJA Harvey, RE Ladner, L Lovász, T Tamir
Journal of Algorithms 59 (1), 53-78, 2006
1312006
On two class-constrained versions of the multiple knapsack problem
H Shachnai, T Tamir
Algorithmica 29, 442-467, 2001
1242001
Polynomial time approximation schemes for class‐constrained packing problems
H Shachnai, T Tamir
Journal of Scheduling 4 (6), 313-338, 2001
1212001
Approximations for monotone and nonmonotone submodular maximization with knapsack constraints
A Kulik, H Shachnai, T Tamir
Mathematics of Operations Research 38 (4), 729-739, 2013
1062013
Transactional contention management as a non-clairvoyant scheduling problem
H Attiya, L Epstein, H Shachnai, T Tamir
Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006
912006
Minimizing total busy time in parallel scheduling with application to optical networks
M Flammini, G Monaco, L Moscardelli, H Shachnai, M Shalom, T Tamir, ...
Theoretical Computer Science 411 (40-42), 3553-3562, 2010
802010
Real-time scheduling to minimize machine busy times
R Khandekar, B Schieber, H Shachnai, T Tamir
Journal of Scheduling 18, 561-573, 2015
67*2015
Windows scheduling as a restricted version of bin packing
A Bar-Noy, RE Ladner, T Tamir
ACM Transactions on Algorithms (TALG) 3 (3), 28-es, 2007
672007
Semi-matchings for bipartite graphs and load balancing
NJA Harvey, RE Ladner, L Lovász, T Tamir
Algorithms and Data Structures: 8th International Workshop, WADS 2003 …, 2003
622003
Conflicting congestion effects in resource allocation games
M Feldman, T Tamir
Operations research 60 (3), 529-540, 2012
56*2012
Approximation schemes for packing with item fragmentation
H Shachnai, T Tamir, O Yehezkely
Theory of Computing Systems 43, 81-98, 2008
522008
Tight bounds for online class-constrained packing
H Shachnai, T Tamir
Theoretical Computer Science 321 (1), 103-123, 2004
472004
A general buffer scheme for the windows scheduling problem
A Bar-Noy, RE Ladner, J Christensen, T Tamir
Journal of Experimental Algorithmics (JEA) 13, 1.6-1.17, 2009
46*2009
A theory and algorithms for combinatorial reoptimization
H Shachnai, G Tamir, T Tamir
Latin American Symposium on Theoretical Informatics, 618-630, 2012
432012
A theory and algorithms for combinatorial reoptimization
H Shachnai, G Tamir, T Tamir
Latin American Symposium on Theoretical Informatics, 618-630, 2012
432012
Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.
Straipsniai 1–20