Peter Jacko

Orcid: 0000-0003-3376-0260

According to our database1, Peter Jacko authored at least 37 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
SIMPLE - A modular tool for simulating complex platform trials.
SoftwareX, July, 2023

NCC: An R-package for analysis and simulation of platform trials with non-concurrent controls.
SoftwareX, July, 2023

2022
Routing with too much information?
Queueing Syst. Theory Appl., 2022

Performance evaluation of scheduling policies for the dynamic and stochastic resource-constrained multi-project scheduling problem.
Int. J. Prod. Res., 2022

Generalisations of a Bayesian decision-theoretic randomisation procedure and the impact of delayed responses.
Comput. Stat. Data Anal., 2022

2021
A Novel Implementation of Q-Learning for the Whittle Index.
Proceedings of the Performance Evaluation Methodologies and Tools, 2021

2020
On the dynamic allocation of assets subject to failure.
Eur. J. Oper. Res., 2020

2019
The Finite-Horizon Two-Armed Bandit Problem with Binary Responses: A Multidisciplinary Survey of the History, State of the Art, and Myths.
CoRR, 2019

Robust Network Capacity Expansion with Non-Linear Costs.
Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

Performance Evaluation of Scheduling Policies for the DRCMPSP.
Proceedings of the Analytical and Stochastic Modelling Techniques and Applications, 2019

2017
Scheduling of multi-class multi-server queueing systems with abandonments.
J. Sched., 2017

Maximal flow-level stability of best-rate schedulers in heterogeneous wireless systems.
Trans. Emerg. Telecommun. Technol., 2017

A Bayesian adaptive design for clinical trials in rare diseases.
Comput. Stat. Data Anal., 2017

2016
Nearly-optimal scheduling of users with Markovian time-varying transmission rates.
Perform. Evaluation, 2016

Optimal dynamic resource allocation to prevent defaults.
Oper. Res. Lett., 2016

Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic.
Ann. Oper. Res., 2016

Tie-breaking can maximize fairness without sacrificing throughput in D2D-assisted networks.
Proceedings of the 17th IEEE International Symposium on A World of Wireless, 2016

2015
Floating band D2D: Exploring and exploiting the potentials of adaptive D2D-enabled networks.
Proceedings of the 16th IEEE International Symposium on A World of Wireless, 2015

2014
Modeling D2D communications with LTE and WiFi.
SIGMETRICS Perform. Evaluation Rev., 2014

An opportunistic and non-anticipating size-aware scheduling proposal for mean holding cost minimization in time-varying channels.
Perform. Evaluation, 2014

Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories.
Oper. Res., 2014

Modeling Multi-mode D2D Communications in LTE.
CoRR, 2014

Opportunistic scheduling of flows with general size distribution in wireless time-varying channels.
Proceedings of the 2014 26th International Teletraffic Congress (ITC), 2014

2013
Congestion control of TCP flows in Internet routers by means of index policy.
Comput. Networks, 2013

Scheduling of users with markovian time-varying transmission rates.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013

2012
Optimal congestion control of TCP flows for internet routers.
SIGMETRICS Perform. Evaluation Rev., 2012

Optimal anticipative congestion control of flows with time-varying input stream.
Perform. Evaluation, 2012

Opportunistic schedulers for optimal scheduling of flows in wireless systems with ARQ feedback.
Proceedings of the 24th International Teletraffic Congress, 2012

CCN interest forwarding strategy as Multi-Armed Bandit model with delays.
Proceedings of the 6th International Conference on Network Games, 2012

2011
Value of information in optimal flow-level scheduling of users with Markovian time-varying channels.
Perform. Evaluation, 2011

Optimal index rules for single resource allocation to stochastic dynamic competitors.
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools Communications, 2011

A nearly-optimal index rule for scheduling of users with abandonment.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Resource-sharing in a single server with time-varying capacity.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
A modeling framework for optimizing the flow-level scheduling with time-varying channels.
Perform. Evaluation, 2010

2008
Admission control and routing to parallel queues with delayed information via marginal productivity indices.
Proceedings of the 3rd International ICST Conference on Performance Evaluation Methodologies and Tools, 2008

2007
Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract).
Electron. Notes Discret. Math., 2007

2005
Distance Coloring of the Hexagonal Lattice.
Discuss. Math. Graph Theory, 2005


  Loading...