Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Eschenfeldt, Patrick"'
Autor:
Lopez-Martinez, Daniel, Eschenfeldt, Patrick, Ostvar, Sassan, Ingram, Myles, Hur, Chin, Picard, Rosalind
Opioids are the preferred medications for the treatment of pain in the intensive care unit. While undertreatment leads to unrelieved pain and poor clinical outcomes, excessive use of opioids puts patients at risk of experiencing multiple adverse effe
Externí odkaz:
http://arxiv.org/abs/1904.11115
Autor:
Eschenfeldt, Patrick Clark
Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2017.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Spe
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Spe
Externí odkaz:
http://hdl.handle.net/1721.1/108834
Autor:
Eschenfeldt, Patrick, Gamarnik, David
We consider a queueing system with $n$ parallel queues operating according to the so-called "supermarket model" in which arriving customers join the shortest of $d$ randomly selected queues. Assuming rate $n\lambda_{n}$ Poisson arrivals and rate $1$
Externí odkaz:
http://arxiv.org/abs/1610.03522
Autor:
Eschenfeldt, Patrick, Gamarnik, David
We consider the problem of packing node-disjoint directed paths in a directed graph. We consider a variant of this problem where each path starts within a fixed subset of root nodes, subject to a given bound on the length of paths. This problem is mo
Externí odkaz:
http://arxiv.org/abs/1603.06002
We introduce a new type of graphical model that we call a "memory factor network" (MFN). We show how to use MFNs to model the structure inherent in many types of data sets. We also introduce an associated message-passing style algorithm called "proac
Externí odkaz:
http://arxiv.org/abs/1601.04667
Autor:
Eschenfeldt, Patrick, Gamarnik, David
We consider queueing systems with n parallel queues under a Join the Shortest Queue (JSQ) policy in the Halfin-Whitt heavy traffic regime. We use the martingale method to prove that a scaled process counting the number of idle servers and queues of l
Externí odkaz:
http://arxiv.org/abs/1502.00999
We analyze an M/M/1 queue with a service discipline in which customers, upon arriving when the server is busy, search a sequence of stations for a vacant station at which to wait, and in which the server, upon becoming free when one or more customers
Externí odkaz:
http://arxiv.org/abs/1108.5356
We consider several stochastic service systems, and study the asymptotic behavior of the moments of various quantities that have application to models for random interval graphs and algorithms for searching for an idle server or empty waiting station
Externí odkaz:
http://arxiv.org/abs/1107.4113
We consider an M/M/Infinity service system in which an arriving customer is served by the first idle server in an infinite sequence S_1, S_2, ... of servers. We determine the first two terms in the asymptotic expansions of the moments of L as lambda
Externí odkaz:
http://arxiv.org/abs/1107.1536
We give a simple derivation of the distribution of the maximum L of the length of the queue during a busy period for the M/M/1 queue with lambda<1 the ratio between arrival rate and service rate. We observe that the asymptotic behavior of the moments
Externí odkaz:
http://arxiv.org/abs/1106.3590