José Niño-Mora - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

2021

Solving Poisson's equation for birth-death chains: Structure, instability, and accurate approximationJosé Niño-Mora. pe, 145:102163, 2021. [doi]

2020

A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless BanditsJosé Niño-Mora. mor, 45(2):465-496, 2020. [doi]

2019

Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximizationJosé Niño-Mora. cor, 103:221-236, 2019. [doi]

2016

Whittle's Index Policy for Multi-Target Tracking with Jamming and NondetectionsJosé Niño-Mora. asmta 2016: 210-222 [doi]

2014

A Dynamic Page-Refresh Index Policy for Web CrawlersJosé Niño-Mora. asmta 2014: 46-60 [doi]

Overcoming numerical instability in one-step policy improvement for admission and routing to queues with firm deadlinesJosé Niño-Mora. netcoop 2014: 127-134 [doi]

2012

Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policiesJosé Niño-Mora. eor, 220(3):705-715, 2012. [doi]

Admission and routing of soft real-time jobs to multiclusters: Design and comparison of index policiesJosé Niño-Mora. cor, 39(12):3431-3444, 2012. [doi]

Index-based dynamic energy management in a multimode sensor networkJosé Niño-Mora. netcoop 2012: 92-95 [doi]

2011

Computing a Classic Index for Finite-Horizon BanditsJosé Niño-Mora. informs, 23(2):254-267, 2011. [doi]

Index-Based Admission Control and Load Balancing of Firm Real-Time Jobs in Multi-clustersJosé Niño-Mora. hpcc 2011: 556-562 [doi]

Sensor scheduling for hunting elusive hiding targets via whittle's restless bandit index policyJosé Niño-Mora, Sofia S. Villar. netcoop 2011: 1-8 [doi]

2010

Index policies for admission and routing of soft real-time traffic to parallel queuesJosé Niño-Mora. sigmetrics, 38(2):21-23, 2010. [doi]

2009

Multitarget tracking via restless bandit marginal productivity indices and Kalman filter in discrete timeJosé Niño-Mora, Sofia S. Villar. cdc 2009: 2905-2910 [doi]

2008

2007

Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)Peter Jacko, José Niño-Mora. endm, 28:145-152, 2007. [doi]

Characterization and computation of restless bandit marginal productivity indicesJosé Niño-Mora. valuetools 2007: 74 [doi]

Computing an index policy for bandits with switching penaltiesJosé Niño-Mora. valuetools 2007: 76 [doi]

Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with RenegingJosé Niño-Mora. netcoop 2007: 138-149 [doi]

2005

Marginal productivity index policies for scheduling restless bandits with switching penaltiesJosé Niño-Mora. Dagstuhl 2005: [doi]

A Marginal Productivity Index Policy for the Finite-Horizon Multiarmed Bandit ProblemJosé Niño-Mora. cdc 2005: 1718-1722 [doi]

2003

Whittle's index policy for a multi-class queueing system with convex holding costsP. S. Ansell, Kevin D. Glazebrook, José Niño-Mora, M. O'Keeffe. mmor, 57(1):21-39, 2003. [doi]

2002

Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approachJosé Niño-Mora. mp, 93(3):361-413, 2002. [doi]

2001

Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable PerformanceKevin D. Glazebrook, José Niño-Mora. ior, 49(4):609-623, 2001. [doi]

2000

Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index HeuristicDimitris Bertsimas, José Niño-Mora. ior, 48(1):80-90, 2000. [doi]

1999

A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraintsP. S. Ansell, Kevin D. Glazebrook, Isi Mitrani, José Niño-Mora. jors, 50(7):765-773, 1999. [doi]

A linear programming approach to stability, optimisationand performance analysis for Markovian multiclassqueueing networksKevin D. Glazebrook, José Niño-Mora. anor, 92:1-18, 1999. [doi]

1997

Scheduling Multiclass Queueing Networks on Parallel Servers: Approximate and Heavy-Traffic Optimality of Klimov s Priority RuleKevin D. Glazebrook, José Niño-Mora. esa 1997: 232-245

1996

Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable SystemsDimitris Bertsimas, José Niño-Mora. mor, 21(2):257-306, 1996. [doi]

1993

Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systemsDimitris Bertsimas, José Niño-Mora. ipco 1993: 355-384

Sign in or sign up to see more results.

runs on WebDSL