Zobrazeno 1 - 10
of 456
pro vyhledávání: '"Cliff Stein"'
Autor:
Viswanath Nagarajan, Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Cliff Stein, Kirk Pruhs
Publikováno v:
SIAM Journal on Computing. 49:37-66
We consider virtual circuit routing protocols with an objective of minimizing energy in a network of components that are speed scalable, and that may be shut down when idle. We assume the standard ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c14120ff36f7c8905af53e1064c73aac
https://doi.org/10.1137/18m1228591
https://doi.org/10.1137/18m1228591
Publikováno v:
FOCS
We present the first algorithm for maintaining a maximal independent set (MIS) of a fully dynamic graph---which undergoes both edge insertions and deletions---in polylogarithmic time. Our algorithm is randomized and, per update, takes $O(\log^2 \Delt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92c256822b43ccd34d5d06891a51f3c6
https://doi.org/10.1109/focs.2019.00032
https://doi.org/10.1109/focs.2019.00032
Publikováno v:
Conference on Integer Programming and Combinatorial Optimization (IPCO) 2019
Conference on Integer Programming and Combinatorial Optimization (IPCO) 2019, May 2019, Ann Arbor, United States. pp.141-154, ⟨10.1007/978-3-030-17953-3_11⟩
Integer Programming and Combinatorial Optimization ISBN: 9783030179526
IPCO
Conference on Integer Programming and Combinatorial Optimization (IPCO) 2019, May 2019, Ann Arbor, United States. pp.141-154, ⟨10.1007/978-3-030-17953-3_11⟩
Integer Programming and Combinatorial Optimization ISBN: 9783030179526
IPCO
We study a fundamental online job admission problem where jobs with deadlines arrive online over time at their release dates, and the task is to determine a preemptive single-server schedule which maximizes the number of jobs that complete on time. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3ff65fc47352243d073383e8eb703f9
https://hal.science/hal-03989537
https://hal.science/hal-03989537
Publikováno v:
STOC
The knapsack problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is one of the most well-known NP-hard problems. The goal is to pack a knapsack of si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7094175189c0fa3ab36013d1d3afe985
https://doi.org/10.1145/3188745.3188876
https://doi.org/10.1145/3188745.3188876
Publikováno v:
LATIN 2018: Theoretical Informatics ISBN: 9783319774039
LATIN
LATIN
We introduce the online Set Aggregation Problem, which is a natural generalization of the Multi-Level Aggregation Problem, which in turn generalizes the TCP Acknowledgment Problem and the Joint Replenishment Problem. We give a deterministic online al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::317499a43e9c9eb953d584b03f32aa2a
https://doi.org/10.1007/978-3-319-77404-6_19
https://doi.org/10.1007/978-3-319-77404-6_19
Publikováno v:
Experimental Algorithms ISBN: 9783319388502
SEA
SEA
Modern data centers face new scheduling challenges in optimizing job-level performance objectives, where a significant challenge is the scheduling of highly parallel data flows with a common performance goal e.g., the shuffle operations in MapReduce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a4d2fd12dba6c3aa25d09a4287958e8
https://doi.org/10.1007/978-3-319-38851-9_18
https://doi.org/10.1007/978-3-319-38851-9_18
Autor:
Cliff Stein, Nourhan Sakr
Publikováno v:
Experimental Algorithms ISBN: 9783319388502
SEA
SEA
This work studies online scheduling algorithms for buffer management, develops new algorithms, and analyzes their performances. Packets arrive at a release time r, with a non-negative weight w and an integer deadline d. At each time step, at most one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b711c202ec6ffbb826d48f562806085
https://doi.org/10.1007/978-3-319-38851-9_19
https://doi.org/10.1007/978-3-319-38851-9_19
Publikováno v:
EMNLP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::003ebb3bbf8a3bf203910ecbf3b05dee
https://doi.org/10.18653/v1/d16-1051
https://doi.org/10.18653/v1/d16-1051