HIGHLIGHTS
- who: LICENSE et al. from the (UNIVERSITY) have published the Article: Query-Age-Optimal Scheduling under Sampling and Transmission Constraints, in the Journal: (JOURNAL)
- what: The authors provide a query-age-optimal policy by solving a CMDP problem with multiple constraints.. Next, the authors provide an optimal policy for problem . The authors develop a low-complexity policy to the main problem via the following procedure: 1) the authors relax the per-slot transmission constraint (5d), 2) transform the relaxed problem to a weakly coupled CMDP problem which is then solved by its equivalent LP , and . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.