Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Dmitriy Katz"'
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:
David Gamarnik, Dmitriy Katz
Publikováno v:
arXiv
The Skorokhod problem arises in studying reflected Brownian motion (RBM) and the associated fluid model on the non-negative orthant. This problem specifically arises in the context of queueing networks in the heavy traffic regime. One of the key prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16a914beeafd4bd8e75cdb4ea95b54cf
https://doi.org/10.1007/s11134-014-9424-8
https://doi.org/10.1007/s11134-014-9424-8
Publikováno v:
INFORMS Journal on Computing. 25:208-221
We develop a new local search algorithm for binary optimization problems, whose complexity and performance are explicitly controlled by a parameter Q, measuring the depth of the local search neighborhood. We show that the algorithm is pseudo-polynomi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d904032f22992e9f6845677297b43841
https://doi.org/10.1287/ijoc.1110.0496
https://doi.org/10.1287/ijoc.1110.0496
Publikováno v:
SPAA
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_________::9aed166d525ad37911a2285b5dadf223
https://doi.org/10.1145/2935764.2935806
https://doi.org/10.1145/2935764.2935806
Publikováno v:
Theory of Computing. 8:209-229
Speed scaling is a power management technology that involves dynamically changing the speed of a processor. This technology gives rise to dual-objective scheduling problems, where the operating system both wants to conserve energy and optimize some Q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e9c790b35ce2145c00a77eabb8f5d95
https://doi.org/10.4086/toc.2012.v008a009
https://doi.org/10.4086/toc.2012.v008a009
Autor:
David Gamarnik, Dmitriy Katz
Publikováno v:
Prof. Gamarnik via Alex Caracuzzo
We consider the problem of computing the permanent of a 0,1n by n matrix. For a class of matrices corresponding to constant degree expanders we construct a deterministic polynomial time approximation algorithm to within a multiplicative factor ([emai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2f21918664be94851d2df08c3b9034f
https://doi.org/10.1016/j.jcss.2010.05.002
https://doi.org/10.1016/j.jcss.2010.05.002
Autor:
Dmitriy Katz, David Gamarnik
Publikováno v:
Journal of Statistical Physics. 137:205-232
We propose a new method for the problems of computing free energy and surface pressure for various statistical mechanics models on a lattice $\Z^d$. Our method is based on representing the free energy and surface pressure in terms of certain marginal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::672455a2bd3bde9dd6b15bd55f04883a
https://doi.org/10.1007/s10955-009-9849-3
https://doi.org/10.1007/s10955-009-9849-3
Publikováno v:
Algorithmica. 50:255-278
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an additive error of at most e using as few samples of f as possible. We use the adaptive framework
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::139ec0ee9637932c59e43671eb26d03e
https://doi.org/10.1007/s00453-007-9093-7
https://doi.org/10.1007/s00453-007-9093-7
Publikováno v:
arXiv
The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise known to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81d6f4054b42c88cf144eb4cedd6d330
https://orcid.org/0000-0001-8898-8778
https://orcid.org/0000-0001-8898-8778
Autor:
Eugene A. Feinberg, Soumyadip Ghosh, Xiaoxuan Zhang, Dmitriy Katz, Mark S. Squillante, Jayant R. Kalagnanam
Publikováno v:
2010 First IEEE International Conference on Smart Grid Communications.
We design an optimal incentive mechanism offered to energy customers at multiple network levels, e.g., distribution and feeder networks, with the aim of determining the lowest-cost aggregate energy demand reduction. Our model minimizes a utility's to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84eee5380f70b32a9bdd64d5e36ed8e1
https://doi.org/10.1109/smartgrid.2010.5622095
https://doi.org/10.1109/smartgrid.2010.5622095