UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Gossip Algorithms

Foundations and trends in networking, 2009, Vol.3 (1), p.1-125

Shah, Devavrat

2009

Volltextzugriff (PDF)

Implicit feedback policies for COVID-19: why "zero-COVID" policies remain elusive

Scientific reports, 2023-02, Vol.13 (1), p.3173-3173, Article 3173

2023

Volltextzugriff (PDF)

Low-Rank Gradient Descent

IEEE Open Journal of Control Systems, 2023, Vol.2, p.380-395

2023

Volltextzugriff (PDF)

Rank Centrality: Ranking from Pairwise Comparisons

Operations research, 2017-01, Vol.65 (1), p.266-287

2017

Volltextzugriff (PDF)

Finding Rumor Sources on Random Trees

Operations research, 2016-05, Vol.64 (3), p.736-755

2016

Volltextzugriff (PDF)

Explaining the Success of Nearest Neighbor Methods in Prediction

Foundations and trends in machine learning, 2018, Vol.10 (5-6), p.337-588

2018

Volltextzugriff (PDF)

Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems

Operations research, 2014-01, Vol.62 (1), p.1-24

2014

Volltextzugriff (PDF)

RANDOMIZED SCHEDULING ALGORITHM FOR QUEUEING NETWORKS

The Annals of applied probability, 2012-02, Vol.22 (1), p.128-171

2012

Volltextzugriff (PDF)

Randomized scheduling algorithms for high-aggregate bandwidth switches

IEEE journal on selected areas in communications, 2003-05, Vol.21 (4), p.546-559

2003

Volltextzugriff (PDF)

Nonasymptotic Analysis of Monte Carlo Tree Search

Operations research, 2022-11, Vol.70 (6), p.3234-3260

2022

Volltextzugriff (PDF)

On Robustness of Principal Component Regression

Journal of the American Statistical Association, 2021-10, Vol.116 (536), p.1731-1745

2021

Volltextzugriff (PDF)

SWITCHED NETWORKS WITH MAXIMUM WEIGHT POLICIES: FLUID APPROXIMATION AND MULTIPLICATIVE STATE SPACE COLLAPSE

The Annals of applied probability, 2012-02, Vol.22 (1), p.70-127

2012

Volltextzugriff (PDF)

A Nonparametric Approach to Modeling Choice with Limited Data

Management science, 2013-02, Vol.59 (2), p.305-322

2013

Volltextzugriff (PDF)

Throughput Region of Finite-Buffered Networks

IEEE transactions on parallel and distributed systems, 2007-02, Vol.18 (2), p.251-263

2007

Volltextzugriff (PDF)

A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints

IEEE transactions on automatic control, 2008-07, Vol.53 (6), p.1419-1433

2008

Volltextzugriff (PDF)

Gradient-Based Empirical Risk Minimization Using Local Polynomial Regression

Stochastic systems, 2024-03

2024

Volltextzugriff (PDF)

Network Coding Meets TCP: Theory and Implementation

Proceedings of the IEEE, 2011-03, Vol.99 (3), p.490-512

2011

Volltextzugriff (PDF)

Unifying Epidemic Models With Mixtures

IEEE transactions on signal and information processing over networks, 2024, Vol.10, p.239-252

2024

Volltextzugriff (PDF)

Iterative Collaborative Filtering for Sparse Matrix Estimation

Operations research, 2022-11, Vol.70 (6), p.3143-3175

2022

Volltextzugriff (PDF)

Resource sharing networks: Overview and an open problem

Stochastic systems, 2015-03, Vol.4 (2), p.524-555

2015

Volltextzugriff (PDF)

Public health implications of opening National Football League stadiums during the COVID-19 pandemic

Proceedings of the National Academy of Sciences - PNAS, 2022-04, Vol.119 (14), p.e2114226119-e2114226119

2022

Volltextzugriff (PDF)

Fluid models of congestion collapse in overloaded switched networks

Queueing systems, 2011-10, Vol.69 (2), p.121-143

2011

Volltextzugriff (PDF)

Counting Independent Sets Using the Bethe Approximation

SIAM journal on discrete mathematics, 2011-01, Vol.25 (2), p.1012-1034

2011

Volltextzugriff (PDF)

Inferring Sparse Preference Lists from Partial Information

Stochastic systems, 2020-12, Vol.10 (4), p.335-360

2020

Volltextzugriff (PDF)

Non-Asymptotic Analysis of Monte Carlo Tree Search

Proceedings of the ACM on measurement and analysis of computing systems, 2020-05, Article 3379476

2020

Volltextzugriff (PDF)

1 – 25 von 191

Menü

Weitere Dienste

Einstellungen

Gossip Algorithms

Implicit feedback policies for COVID-19: why "zero-COVID" policies remain elusive

Low-Rank Gradient Descent

Rank Centrality: Ranking from Pairwise Comparisons

Finding Rumor Sources on Random Trees

Explaining the Success of Nearest Neighbor Methods in Prediction

Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems

RANDOMIZED SCHEDULING ALGORITHM FOR QUEUEING NETWORKS

Randomized scheduling algorithms for high-aggregate bandwidth switches

Nonasymptotic Analysis of Monte Carlo Tree Search

On Robustness of Principal Component Regression

SWITCHED NETWORKS WITH MAXIMUM WEIGHT POLICIES: FLUID APPROXIMATION AND MULTIPLICATIVE STATE SPACE COLLAPSE

A Nonparametric Approach to Modeling Choice with Limited Data

Throughput Region of Finite-Buffered Networks

A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints

Gradient-Based Empirical Risk Minimization Using Local Polynomial Regression

Network Coding Meets TCP: Theory and Implementation

Unifying Epidemic Models With Mixtures

Iterative Collaborative Filtering for Sparse Matrix Estimation

Resource sharing networks: Overview and an open problem

Public health implications of opening National Football League stadiums during the COVID-19 pandemic

Fluid models of congestion collapse in overloaded switched networks

Counting Independent Sets Using the Bethe Approximation

Inferring Sparse Preference Lists from Partial Information

Non-Asymptotic Analysis of Monte Carlo Tree Search

Aktive Filter

Suchergebnisse filtern