Global, regional, and national comparative risk assessment of 84 behavioural, environmental and occupational, and metabolic risks or clusters of risks for 195 …
JD Stanaway, A Afshin, E Gakidou, SS Lim, D Abate… - The Lancet, 2018 - thelancet.com
Summary Background The Global Burden of Diseases, Injuries, and Risk Factors Study
(GBD) 2017 comparative risk assessment (CRA) is a comprehensive approach to risk factor …
(GBD) 2017 comparative risk assessment (CRA) is a comprehensive approach to risk factor …
A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice
While methods for optimization under uncertainty have been studied intensely over the past
decades, the explicit consideration of the interplay between uncertainty and time has gained …
decades, the explicit consideration of the interplay between uncertainty and time has gained …
Competitive caching with machine learned advice
Traditional online algorithms encapsulate decision making under uncertainty, and give ways
to hedge against all possible future events, while guaranteeing a nearly optimal solution, as …
to hedge against all possible future events, while guaranteeing a nearly optimal solution, as …
Beyond worst-case analysis
T Roughgarden - Communications of the ACM, 2019 - dl.acm.org
Beyond worst-case analysis Page 1 88 COMMUNICATIONS OF THE ACM | MARCH 2019 |
VOL. 62 | NO. 3 review articles COMPARING DIFFERENT ALGORITHMS is hard. For almost …
VOL. 62 | NO. 3 review articles COMPARING DIFFERENT ALGORITHMS is hard. For almost …
Online algorithms: a survey
S Albers - Mathematical Programming, 2003 - Springer
During the last 15 years online algorithms have received considerable research interest. In
this survey we give an introduction to the competitive analysis of online algorithms and …
this survey we give an introduction to the competitive analysis of online algorithms and …
Hyperbolic caching: Flexible caching for web applications
Today's web applications rely heavily on caching to reduce latency and backend load, using
services like Redis or Memcached that employ inflexible caching algorithms. But the needs …
services like Redis or Memcached that employ inflexible caching algorithms. But the needs …
Learning-augmented weighted paging
We consider a natural semi-online model for weighted paging, where at any time the
algorithm is given predictions, possibly with errors, about the next arrival of each page. The …
algorithm is given predictions, possibly with errors, about the next arrival of each page. The …
On-line algorithms
Over the past twelve years, online algorithms have received considerable research interest.
Online problems had been investigated already in the seventies and early eighties but an …
Online problems had been investigated already in the seventies and early eighties but an …
An improved algorithm finding nearest neighbor using kd-trees
R Panigrahy - Latin American symposium on theoretical informatics, 2008 - Springer
We suggest a simple modification to the Kd-tree search algorithm for nearest neighbor
search resulting in an improved performance. The Kd-tree data structure seems to work well …
search resulting in an improved performance. The Kd-tree data structure seems to work well …
Stochastic k-server: How should Uber work?
In this paper, we study a stochastic variant of the celebrated k-server problem. In the k-server
problem, we are required to minimize the total movement of k servers that are serving an …
problem, we are required to minimize the total movement of k servers that are serving an …