A low-complexity, near-optimal scheduling policy for solving a restless multi-armed bandit problem occurring in a single-hop wireless network


Öğrenci: ÖMER MELİH GÜL

Danışman: ELİF UYSAL BIYIKOĞLU