Online Scheduling for Throughput Maximization of Time-varying Markovian Channels with Unknown Statistics
arXiv 2608.19398•ec6554782527fc52b54f80fcbb048640b26c543c27c615d2abed25b751c79046
RF-modelingUAV-networksacademic-researchanonymous-communicationattribute-based-encryptionblockchainmission-critical-communicationsnetworkingphysical-AIpost-quantum-cryptographyroutingwireless-networks
Paper metadata
- arXiv ID
- 2608.19398
- Version
- Not specified by this published record
- Category
- Computer Science — Networking and Internet Architecture (cs.NI)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_cs_ni
- Record identifier
- ec6554782527fc52b54f80fcbb048640b26c543c27c615d2abed25b751c79046
- Enrichment time
- 2026-08-21T07:23:43Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.