ÖMER MELIH GÜL , A LOW-COMPLEXITY, NEAR-OPTIMAL SCHEDULING POLICY FOR SOLVING A RESTLESS MULTI-ARMED BANDIT PROBLEM OCCURRING IN A SINGLE-HOP WIRELESS NETWORK , 2014

Thesis title: A LOW-COMPLEXITY, NEAR-OPTIMAL SCHEDULING POLICY FOR SOLVING A RESTLESS MULTI-ARMED BANDIT PROBLEM OCCURRING IN A SINGLE-HOP WIRELESS NETWORK By:  ÖMER MELIH GÜL ABSTRACT : Power resources and battery lifetime are important issues for wireless networks such as wireless Read More …