Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeil S. Walton
Person information
- affiliation: University of Manchester, UK / University of Amsterdam, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j18]Neil Walton
, Denis Denisov:
Regret Analysis of a Markov Policy Gradient Algorithm for Multiarm Bandits. Math. Oper. Res. 48(3): 1553-1588 (2023)- 2022
- [j17]Neil Walton:
Queueing: a perennial theory. Queueing Syst. Theory Appl. 100(3-4): 557-559 (2022) - [j16]Nicolas Gast, Neil Walton:
Special Issue on the Workshop about Reinforcement Learning in Networks and Queues (RLNQ 2021). SIGMETRICS Perform. Evaluation Rev. 49(2): 42 (2022) - [j15]Jonatha Anselmi, Neil Walton:
Stability and Optimization of Speculative Queueing Networks. IEEE/ACM Trans. Netw. 30(2): 911-922 (2022) - 2021
- [j14]Maury Bramson, Bernardo D'Auria, Neil Walton:
Stability and Instability of the MaxWeight Policy. Math. Oper. Res. 46(4): 1611-1638 (2021) - 2019
- [j13]Varun Gupta, Neil Walton:
Load Balancing in the Nondegenerate Slowdown Regime. Oper. Res. 67(1): 281-294 (2019) - [j12]Orcun Karaca, Pier Giuseppe Sessa, Neil Walton, Maryam Kamgarpour:
Designing Coalition-Proof Reverse Auctions Over Continuous Goods. IEEE Trans. Autom. Control. 64(11): 4803-4810 (2019) - 2017
- [j11]Maury Bramson, Bernardo D'Auria, Neil Walton:
Proportional Switching in First-in, First-out Networks. Oper. Res. 65(2): 496-513 (2017) - 2016
- [j10]Frank P. Kelly, Peter B. Key, Neil Walton:
Efficient Advert Assignment. Oper. Res. 64(4): 822-837 (2016) - [j9]Jonatha Anselmi, Neil Walton:
Decentralized Proportional Load Balancing. SIAM J. Appl. Math. 76(1): 391-410 (2016) - 2015
- [j8]Neil Walton:
Concave switching in single-hop and multihop networks. Queueing Syst. Theory Appl. 81(2-3): 265-299 (2015) - 2014
- [j7]Neil S. Walton:
Two queues with non-stochastic arrivals. Oper. Res. Lett. 42(1): 53-57 (2014) - 2013
- [j6]Jonatha Anselmi, Bernardo D'Auria, Neil Walton:
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence. Math. Oper. Res. 38(3): 469-491 (2013) - [j5]Sem C. Borst, Neil S. Walton, Bert Zwart:
Network iso-elasticity and weighted α-fairness. Perform. Evaluation 70(11): 995-1000 (2013) - 2011
- [j4]Eiko Yoneki, Jon Crowcroft, Pietro Liò, Neil Walton, Milan Vojnovic, Roger M. Whitaker:
Message from the workshop on the future of social networking. Comput. Commun. Rev. 41(3): 14-18 (2011) - [j3]Neil S. Walton:
Insensitive, maximum stable allocations converge to proportional fairness. Queueing Syst. Theory Appl. 68(1): 51-60 (2011) - [j2]Neil S. Walton, M. R. H. Mandjes:
A stability conjecture on bandwidth sharing networks. Queueing Syst. Theory Appl. 68(3-4): 237-250 (2011) - 2009
- [j1]Frank P. Kelly, Laurent Massoulié, Neil S. Walton:
Resource pooling in congested networks: proportional fairness and product form. Queueing Syst. Theory Appl. 63(1-4): 165-194 (2009)
Conference and Workshop Papers
- 2023
- [c9]Anh T. Hoang, Neil Walton, Hai L. Vu:
Optimal distributed signal control for platooning in connected vehicle networks. ITSC 2023: 1679-1685 - 2020
- [c8]Thomas McSweeney, Neil Walton, Mawussi Zounon:
An Efficient New Static Scheduling Heuristic for Accelerated Architectures. ICCS (1) 2020: 3-16 - 2019
- [c7]Neil S. Walton, John W. Sheppard, Joseph A. Shaw:
Using a genetic algorithm with histogram-based feature selection in hyperspectral image classification. GECCO 2019: 1364-1372 - 2015
- [c6]Peter Kovacs, Gaurav Raina, Neil Walton:
Ramp and signal control: Where motorways and urban roads meet. COMSNETS 2015: 1-6 - 2014
- [c5]Neil S. Walton:
Store-forward and its implications for proportional scheduling. Allerton 2014: 1174-1181 - [c4]Frank P. Kelly, Peter B. Key, Neil S. Walton:
Incentivized optimal advert assignment via utility decomposition. EC 2014: 527 - [c3]Neil Stuart Walton:
Concave switching in single and multihop networks. SIGMETRICS 2014: 139-151 - 2012
- [c2]Devavrat Shah, Neil S. Walton, Yuan Zhong:
Optimal queue-size scaling in switched networks. SIGMETRICS 2012: 17-28 - 2009
- [c1]Neil Walton:
Utility optimization in congested queueing networks: invited presentation, extended abstract. VALUETOOLS 2009: 54
Informal and Other Publications
- 2024
- [i19]Shangda Yang, Vitaly Zankin, Maximilian Balandat, Stefan Scherer, Kevin Carlberg, Neil Walton, Kody J. H. Law:
Accelerating Look-ahead in Bayesian Optimization: Multilevel Monte Carlo is All you Need. CoRR abs/2402.02111 (2024) - 2022
- [i18]Kody J. H. Law, Neil Walton, Shangda Yang, Ajay Jasra:
Multi-index Sequential Monte Carlo ratio estimators for Bayesian Inverse problems. CoRR abs/2203.05351 (2022) - [i17]Kody J. H. Law, Neil S. Walton, Shangda Yang:
Convergence Rates for Stochastic Approximation on a Boundary. CoRR abs/2208.07243 (2022) - 2021
- [i16]Jonatha Anselmi, Neil Walton:
Stability and Optimization of Speculative Queueing Networks. CoRR abs/2104.10426 (2021) - [i15]Alvaro Cabrejas Egea, Raymond Zhang, Neil Walton:
Reinforcement Learning for Traffic Signal Control: Comparison with Commercial Systems. CoRR abs/2104.10455 (2021) - [i14]Neil Walton, Kuang Xu:
Learning and Information in Stochastic Networks and Queues. CoRR abs/2105.08769 (2021) - 2020
- [i13]Denis Denisov, Neil Walton:
Regret Analysis of a Markov Policy Gradient Algorithm for Multi-arm Bandits. CoRR abs/2007.10229 (2020) - [i12]Neil Walton:
A Short Note on Soft-max and Policy Gradients in Bandits Problems. CoRR abs/2007.10297 (2020) - [i11]Jack R. McKenzie, Peter A. Appleby, Thomas A. House, Neil Walton:
Fast Approximate Bayesian Contextual Cold Start Learning (FAB-COST). CoRR abs/2008.08038 (2020) - [i10]Neil Walton, Yuqing Zhang:
Perturbed Pricing. CoRR abs/2010.12300 (2020) - [i9]Neil Walton:
An Adiabatic Theorem for Policy Tracking with TD-learning. CoRR abs/2010.12848 (2020) - 2019
- [i8]Maury Bramson, Bernardo D'Auria, Neil Walton:
Stability and Instability of the MaxWeight Policy. CoRR abs/1909.10825 (2019) - 2017
- [i7]Orcun Karaca, Pier Giuseppe Sessa, Neil Walton, Maryam Kamgarpour:
Game Theoretic Analysis of Auction Mechanisms Modeled by Constrained Optimization Problems. CoRR abs/1711.06774 (2017) - 2016
- [i6]Pier Giuseppe Sessa, Neil Walton, Maryam Kamgarpour:
Exploring Vickrey-Clarke-Groves Mechanism for Electricity Markets. CoRR abs/1611.03044 (2016) - 2014
- [i5]Neil Walton:
Concave Switching in Single and Multihop Networks. CoRR abs/1404.2725 (2014) - [i4]Frank P. Kelly, Peter B. Key, Neil S. Walton:
Incentivized Optimal Advert Assignment via Utility Decomposition. CoRR abs/1404.2750 (2014) - [i3]Neil S. Walton:
Store-Forward and its implications for Proportional Scheduling. CoRR abs/1409.5327 (2014) - 2012
- [i2]Sem C. Borst, Neil S. Walton, A. P. Zwart:
Network iso-elasticity and weighted α-fairness. CoRR abs/1201.2292 (2012) - 2011
- [i1]Devavrat Shah, Neil S. Walton, Yuan Zhong:
Optimal Queue-Size Scaling in Switched Networks. CoRR abs/1110.4697 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 04:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
