Статии с изисквания за обществен достъп - Kirk PruhsНаучете повече
Налице някъде: 33
A 2-competitive algorithm for online convex optimization with switching costs
N Bansal, A Gupta, R Krishnaswamy, K Pruhs, K Schewior, C Stein
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
Изисквания: German Research Foundation, European Commission
Chasing convex bodies and functions
A Antoniadis, N Barcelo, M Nugent, K Pruhs, K Schewior, M Scquizzato
LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016
Изисквания: US National Science Foundation, German Research Foundation
Average rate speed scaling
N Bansal, DP Bunde, HL Chan, K Pruhs
LATIN 2008: Theoretical Informatics: 8th Latin American Symposium, Búzios …, 2008
Изисквания: Howard Hughes Medical Institute
The one-dimensional Euclidean domain: finitely many obstructions are not enough
J Chen, KR Pruhs, GJ Woeginger
Social Choice and Welfare 48 (2), 409-432, 2017
Изисквания: US National Science Foundation, Netherlands Organisation for Scientific …
Average rate speed scaling
N Bansal, DP Bunde, HL Chan, K Pruhs
Algorithmica 60 (4), 877-889, 2011
Изисквания: Howard Hughes Medical Institute
Competitively scheduling tasks with intermediate parallelizability
S Im, B Moseley, K Pruhs, E Torng
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-19, 2016
Изисквания: US National Science Foundation
Matroid Coflow Scheduling.
S Im, B Moseley, K Pruhs, M Purohit
ICALP, 2019
Изисквания: US National Science Foundation
The itinerant list update problem
N Olver, K Pruhs, K Schewior, R Sitters, L Stougie
International Workshop on Approximation and Online Algorithms, 310-326, 2018
Изисквания: US National Science Foundation, German Research Foundation, Netherlands …
The online set aggregation problem
RA Carrasco, K Pruhs, C Stein, J Verschae
LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018
Изисквания: US National Science Foundation
The matroid intersection cover problem
S Im, B Moseley, K Pruhs
Operations Research Letters 49 (1), 17-22, 2021
Изисквания: US National Science Foundation
Minimizing maximum flow time on related machines via dynamic posted pricing
S Im, B Moseley, K Pruhs, C Stein
25th Annual European Symposium on Algorithms (ESA 2017), 51: 1-51: 10, 2017
Изисквания: US National Science Foundation
Tight bounds for double coverage against weak adversaries
N Bansal, M Eliáš, Ł Jeż, G Koumoutsos, K Pruhs
Theory of Computing Systems 62, 349-365, 2018
Изисквания: US National Science Foundation, Netherlands Organisation for Scientific …
Efficient computation of optimal energy and fractional weighted flow trade-off schedules
A Antoniadis, N Barcelo, ME Consuegra, P Kling, M Nugent, K Pruhs, ...
31st International Symposium on Theoretical Aspects of Computer Science …, 2014
Изисквания: German Research Foundation
Unconditional coresets for regularized loss minimization
A Samadian, K Pruhs, B Moseley, S Im, R Curtin
International Conference on Artificial Intelligence and Statistics, 482-492, 2020
Изисквания: US National Science Foundation
An o (log log m)-competitive algorithm for online machine minimization
S Im, B Moseley, K Pruhs, C Stein
2017 IEEE Real-Time Systems Symposium (RTSS), 343-350, 2017
Изисквания: US National Science Foundation
A competitive algorithm for throughput maximization on identical machines
B Moseley, K Pruhs, C Stein, R Zhou
International Conference on Integer Programming and Combinatorial …, 2022
Изисквания: US National Science Foundation
DWMAcc: Accelerating shift-based CNNs with domain wall memories
Z Chen, Q Deng, N Xiao, K Pruhs, Y Zhang
ACM Transactions on Embedded Computing Systems (TECS) 18 (5s), 1-19, 2019
Изисквания: US National Science Foundation, National Natural Science Foundation of China
Dynamic weighted fairness with minimal disruptions
S Im, B Moseley, K Munagala, K Pruhs
Proceedings of the ACM on Measurement and Analysis of Computing Systems 4 (1 …, 2020
Изисквания: US National Science Foundation, US Department of Defense
A poly-log competitive posted-price algorithm for online metrical matching on a spider
M Bender, J Gilbert, K Pruhs
International Symposium on Fundamentals of Computation Theory, 67-84, 2021
Изисквания: US National Science Foundation
A relational gradient descent algorithm for support vector machine training
M Abo-Khamis, S Im, B Moseley, K Pruhs, A Samadian
Symposium on Algorithmic Principles of Computer Systems (APOCS), 100-113, 2021
Изисквания: US National Science Foundation
Информацията за публикацията и осигуреното финансиране се определя автоматично от компютърна програма