Zobrazeno 1 - 10
of 138
pro vyhledávání: '"Baruch Schieber"'
Publikováno v:
Proceedings of the VLDB Endowment. 16:317-329
Given m users (voters), where each user casts her preference for a single item (candidate) over n items (candidates) as a ballot, the preference aggregation problem returns k items (candidates) that have the k highest number of preferences (votes). O
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::606371db502c5fecd70aa19c7e0a6607
https://doi.org/10.14778/3565816.3565832
https://doi.org/10.14778/3565816.3565832
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783031270505
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75528bf6a27e15ca118bb717750ca1bd
https://doi.org/10.1007/978-3-031-27051-2_26
https://doi.org/10.1007/978-3-031-27051-2_26
Publikováno v:
Proceedings of the 2022 International Conference on Management of Data.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70687e5eb9ea943fc3fde2025aafacb4
https://doi.org/10.1145/3514221.3517865
https://doi.org/10.1145/3514221.3517865
Publikováno v:
Mathematics of Operations Research. 45:1-14
The [Formula: see text]-supplier problem is a fundamental location problem that involves opening [Formula: see text] facilities to minimize the maximum distance of any client to an open facility. We consider the [Formula: see text]-supplier problem i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5f5d6ea7cace1e02325590448597988
https://doi.org/10.1287/moor.2018.0953
https://doi.org/10.1287/moor.2018.0953
Publikováno v:
Algorithmica. 81:3217-3244
Motivated by the cloud computing paradigm, and by key optimization problems in all-optical networks, we study two variants of the classic job interval scheduling problem, where a reusable resource is allocated to competing job intervals in a flexible
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35eeab6725ef7016da9ac7299f73effe
https://doi.org/10.1007/s00453-019-00582-9
https://doi.org/10.1007/s00453-019-00582-9
Autor:
Shlomi Dolev, Baruch Schieber
This book constitutes the proceedings of 25th International Symposium, SSS 2023, in Jersey City, NJ, USA, in October 2023.The 32 full papers presented together with 8 short papers were carefully reviewed and selected from 78 submissions. The conferen
Publikováno v:
Algorithmica. 80:576-607
Many real-life applications involve systems that change dynamically over time. Thus, throughout the continuous operation of such a system, it is required to compute solutions for new problem instances, derived from previous instances. Since the trans
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bad341439fb0462e573948a122bb3f2
https://doi.org/10.1007/s00453-017-0274-8
https://doi.org/10.1007/s00453-017-0274-8
Autor:
Roy Schwartz, Moran Feldman, Tami Tamir, Hadas Shachnai, Ron Adany, Rohit Khandekar, Baruch Schieber, Elad Haramaty
Publikováno v:
ACM Transactions on Algorithms. 12:1-25
We study a variant of the generalized assignment problem ( gap ), which we label all-or-nothing gap ( agap ). We are given a set of items, partitioned into n groups, and a set of m bins. Each item ℓ has size s ℓ > 0, and utility a ℓ j ⩾ 0 if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::633023bac06deb19932837f2eb507f13
https://doi.org/10.1145/2843944
https://doi.org/10.1145/2843944
Publikováno v:
SPAA
Cloud services require the allocation of scarce resources to multiple user requests (jobs) in a setting that facilitates preemption and migration while respecting resource and timing constraints. This gives rise to the following variants of the class
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec11a96b2450f30e9d50ef7a82715a31
https://doi.org/10.1145/3210377.3210666
https://doi.org/10.1145/3210377.3210666