Skip to content

Georgios Paschos

personal website and blog

Home
Publications
Articles
Biography
Contact

C.64 Complexity of URLLC Scheduling and Efficient Approximation Schemes

A. Destounis and G. Paschos – WiOPT 2019 [arxiv.org]

Post navigation

Previous Previous post: C.63 Learn2MAC: Online Learning Multiple Access for URLLC Applications

Next Next post: C.65 Learning to Cooperate in D2D Caching Networks

About Me

Welcome to my homepage! I am head of Research Science group at Amazon Transportation Services, Luxembourg, working in optimization and machine learning algorithms, with applications to automated and sustainable transportation.

Venues
Applications
Tools

ComMag ComputerNetworks GLOBECOM ICML INFOCOM JSAC MOBIHOC TNSM TransInformationTheory TransNetworking TransWirelessComm WIOPT

Caching Cloud computing Energy Saving Fairness Game Theory ICN Localization Machine Learning Markov Decision Process Mobile communications Multicast Network Coding Network Slicing SDN URLLC User Association Video Streaming WiFi

ADMM Backpressure Coded caching Data-driven Optimization Evacuation Mirror Descent Network Optimization Online Convex Optimization Optimization Percolation Performance Analysis Routing Scaling Laws Scheduling Stochastic Modeling

Search for:

Categories

articles (5)
no category (2)
papers (101)
- books (2)
- chapters (4)
- conferences (67)
- journals (28)

Recent Comments

Archives

Archives

Home
Publications
Articles
Biography
Contact

Georgios Paschos