Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 11 of 11 for “"order-optimal"”.

  1. Cooperative Strategies for Near-Optimal Computation in Wireless Networks

    … unclear. In this thesis, I seek after near-optimal computation strategies under realistic wireless models. For both network coding and averaging con- sensus, cooperative communications plays a key role. For network cod- ing, I consider two topologies: a single-layer network in which users …

    rice Repository record for Cooperative Strategies for Near-Optimal Computation in Wireless Networks (opens in a new tab)

  2. Rankings: From similarity distances computation to interactive synchronization

    … protocols developed under the given model are order-optimal with respect to genie-aided lower bounds.

    uiuc Repository record for Rankings: From similarity distances computation to interactive synchronization (opens in a new tab)

  3. Design and Analysis of Wireless Networks: Connectivity, Coverage, and Capacity

    … of relaying by repeated decode-and-forward is order optimal even in the presence of fading.

    uiuc Repository record for Design and Analysis of Wireless Networks: Connectivity, Coverage, and Capacity (opens in a new tab)

  4. Integral Manifold in System Design With Application to Flexible Link Robot Control

    … Finally, we showed the existence of a lower order optimal problem which is equivalent to a singularly perturbed optimal problem with initial conditions restricted to a manifold.

    uiuc Repository record for Integral Manifold in System Design With Application to Flexible Link Robot Control (opens in a new tab)

  5. ONLINE LEARNING AND ITS APPLICATIONS IN ELECTRICITY MARKETS

    … problem. It is shown that MSPSA is an order optimal learning policy in terms of regret growth rate. More specifically, the regret of MSPSA grows at the order of the square root of the learning horizon, and the regret of any policy grows no slower than that of MSPSA. Furthermore, it is …

    cornell Repository record for ONLINE LEARNING AND ITS APPLICATIONS IN ELECTRICITY MARKETS (opens in a new tab)

  6. On upper confidence bound algorithms for piecewise-stationary stochastic multi-armed bandits and the variants

    … have been proposed in the literature, which are order optimal compared with the lower bound. Original MAB problems are considered in a stationary environment, where the reward distributions do not evolve over time. Many real-world applications, however, have a non-stationary nature that cannot be …

    uiuc Repository record for On upper confidence bound algorithms for piecewise-stationary stochastic multi-armed bandits and the variants (opens in a new tab)

  7. Control of wireless networks under uncertain state information

    … the channels and achieve high throughput. The optimal balance between these objectives is determined by the network's stochastic traffic demand. Solving this joint learning and scheduling problem is complex. In this thesis, we devise queue-length-based scheduling policies that can adapt to the …

    mit Repository record for Control of wireless networks under uncertain state information (opens in a new tab)

  8. Algorithms for large-scale personalization

    … for massive datasets. Further, we establish near-optimal recovery guarantees that represent an order improvement over the best available results for this problem. Experimental results from a music recommendation platform are shown. Second, we apply this de-noising framework to new applications in …

    mit Repository record for Algorithms for large-scale personalization (opens in a new tab)

  9. Learning-NUM: Utility Maximization in Stochastic Queueing Networks

    … of allocating traffic rates to network users in order to maximize the users’ total utility subject to network resource constraints. We propose a new paradigm of utility maximization in stochastic queueing networks where the utility functions are unknown in advance but function values …

    mit Repository record for Learning-NUM: Utility Maximization in Stochastic Queueing Networks (opens in a new tab)

  10. Fundamentals of Cache Aided Wireless Networks

    … using the new lower bounds, we establish the optimal storage-rate trade-off to within a constant multiplicative gap and show that, for the case of multiple demands per user, treating each set of demands independently is order-optimal. To address the concerns of privacy in multicast content …

    vt Repository record for Fundamentals of Cache Aided Wireless Networks (opens in a new tab)

  11. Flexibility in Platform Operations

    … (compared to a clairvoyant) in T periods from an order of square-root-T in the literature to a bounded constant. A related application appears in e-commerce, where retailers seek to use promotional discounts to align customer demand with their inventory position. Chapter 4 investigates how …

    mit Repository record for Flexibility in Platform Operations (opens in a new tab)