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 5 of 5 for “"Storage complexity."”.

  1. Low-complexity, low-regret link rate selection in rapidly varying wireless channels

    … Thompson sampling results in a computational and storage complexity that grows exponentially with time. Therefore, we propose an algorithm called modified Thompson sampling (MTS), whose computational and storage complexity is simply linear in the number of channel states and which achieves at most …

    uiuc Repository record for Low-complexity, low-regret link rate selection in rapidly varying wireless channels (opens in a new tab)

  2. Novel parallel computing decoupling methods for power system distribution networks

    … in this work are reducing computational complexity, storage complexity, and employing general-purpose computers to allow simulation of large power networks using RT-systems. The Compensated Distributed Line Decoupling (CDLD) method enhances the existing Stubline decoupling by improving …

    utc Repository record for Novel parallel computing decoupling methods for power system distribution networks (opens in a new tab)

  3. Information storage capacity of genetic algorithm fitness maps.

    … The amount of information generated, minus the storage capacity, gives a tighter estimate on the levels of information generated by genetic algorithms. To measure the information storage capacity of fitness maps, we use the method suggested by Abu-Mostafa et al. (Abu-Mostafa and St Jacques, …

    baylor Repository record for Information storage capacity of genetic algorithm fitness maps. (opens in a new tab)

  4. Improving the Capacity in Wireless Ad Hoc Networks through Multiple Channel Operation: Design Principles and Protocols

    … lower communication, computation, and storage complexity, compared with existing approaches. As examples, I present two such protocols that build on standard reactive and proactive routing protocols. In addition, I prove the correctness of the algorithms and derive an upper bound on the …

    vt Repository record for Improving the Capacity in Wireless Ad Hoc Networks through Multiple Channel Operation: Design Principles and Protocols (opens in a new tab)

  5. Efficient Image and Video Representations for Retrieval

    … into high dimensional binary codes, to reduce storage complexity. In this approach, we deviate from adopting traditional hyperplane hashing functions and instead learn hyperspherical hashing functions. The proposed method overcomes the computational challenges of directly applying the spherical …

    maryland Repository record for Efficient Image and Video Representations for Retrieval (opens in a new tab)