activity
20112019
most citedSupermarket Queueing System in the Heavy Traffic Regime. Short Queue Dynamics

16 citations · 35 across the 10 of their papers we have counts for

collaborators

10 papers

cs.LG2019

Deep Reinforcement Learning for Optimal Critical Care Pain Management with Morphine using Dueling Double-Deep Q Networks

Daniel Lopez-Martinez, Patrick Eschenfeldt, Sassan Ostvar +3

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…

math.PR2016★ 16 cited

Supermarket Queueing System in the Heavy Traffic Regime. Short Queue Dynamics

Patrick Eschenfeldt, David Gamarnik

We consider a queueing system with parallel queues operating according to the so-called "supermarket model" in which arriving customers join the shortest of randomly select…

cs.DS2016

A Message Passing Algorithm for the Problem of Path Packing in Graphs

Patrick Eschenfeldt, David Gamarnik

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 node…

cs.AI2016

Proactive Message Passing on Memory Factor Networks

Patrick Eschenfeldt, Dan Schmidt, Stark Draper +1

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…

math.PR2015★ 14 cited

Join the Shortest Queue with Many Servers. The Heavy Traffic Asymptotics

Patrick Eschenfeldt, David Gamarnik

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 tha…

math.PR2011

Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service

Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger

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,…