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 20 of 50 for “"Performance bound"”.

  1. Performance analysis of the interference adaptation dynamic channel allocation technique in wireless communication networks

    … strategy in the literature is nearly blank. The performance of a, DCA algorithm in TDMA/FDMA wireless systems is influenced by three factors: representation of the interference, traffic fluctuation, and the processing power of the algorithm. The major obstacle in analyzing IA-DCA is the …

    njit Repository record for Performance analysis of the interference adaptation dynamic channel allocation technique in wireless communication networks (opens in a new tab)

  2. Control of Uncertain Dynamical Systems with Spatial and Temporal Constraints

    … usually arise from the physical and/or performance characteristics associated with a considered dynamical system in safety-critical applications, where synthesis and analysis of feedback control laws are not trivial. Specifically, the proposed control architectures in this dissertation …

    usf Repository record for Control of Uncertain Dynamical Systems with Spatial and Temporal Constraints (opens in a new tab)

  3. Distributed estimation in resource-constrained wireless sensor networks

    … efficiency (bandwidth and energy), system performance (estimation distortion and network lifetime), and implementation simplicity. More specifically, we address the efficient distributed estimation from the following perspectives: (i) rate-distortion perspective, where the objective is to …

    gatech Repository record for Distributed estimation in resource-constrained wireless sensor networks (opens in a new tab)

  4. Optimal control based method for design and analysis of continuous descent arrivals

    … air traffic controllers should know the performance bound of the CDA trajectory and control the time of arrival for each aircraft, which is interpreted as Required Time of Arrival (RTA) from the aircraft standpoint. This thesis proposes a novel trajectory optimization methodology to meet …

    gatech Repository record for Optimal control based method for design and analysis of continuous descent arrivals (opens in a new tab)

  5. FUNDAMENTAL PERFORMANCE LIMITS OF STATISTICAL PROBLMES: FROM HYPOTHESIS TESTING TO THE LOTTERY TICKETS HYPOTHESIS

    … In this thesis, we investigate fundamental performance limits in three problems that have emerged with the rise of machine learning. These problems are sequential composite hypothesis testing, sequential adversarial hypothesis testing game, and explaining the mask-reconstruction-based …

    nus Repository record for FUNDAMENTAL PERFORMANCE LIMITS OF STATISTICAL PROBLMES: FROM HYPOTHESIS TESTING TO THE LOTTERY TICKETS HYPOTHESIS (opens in a new tab) Download file for FUNDAMENTAL PERFORMANCE LIMITS OF STATISTICAL PROBLMES: FROM HYPOTHESIS TESTING TO THE LOTTERY TICKETS HYPOTHESIS (opens in a new tab)

  6. Baseband Implementation and Performance Analysis of the Multiband OFDM UWB System

    … programming language. We also analyze the system performance in the multipath fading channel, the IEEE 802.15.3a channel standard. Four different conditions of frequency and timing synchronization are considered. Since the entire system consists of two subsystems: (a) the channel coding with the …

    maryland Repository record for Baseband Implementation and Performance Analysis of the Multiband OFDM UWB System (opens in a new tab)

  7. Learning Features for Unsupervised Learning and Reinforcement Learning

    … prove its theoretical properties by showing its performance bound, and demonstrate its practical benefits in deep RL by stabilizing deep Q-networks.</p>

    duke Repository record for Learning Features for Unsupervised Learning and Reinforcement Learning (opens in a new tab)

  8. Discrete Optimization Methods for Segmentation and Matching

    … develop an efficient algorithm with a worst-case performance bound of $\frac{1}{2}$ for the superpixel segmentation problem. Extensive experiments on the Berkeley segmentation benchmark show the proposed algorithm outperforms the state of the art in all the standard evaluation metrics. Next, I …

    maryland Repository record for Discrete Optimization Methods for Segmentation and Matching (opens in a new tab)

  9. The Application of Modern Black-box Optimization Algorithms to Problems in SiGe HBT Device Design

    … detailing the Pareto front discovery, or the performance bound discovery, of the collector at cryogenic temperatures. Chapter 6 provides conclusions and future work.

    gatech Repository record for The Application of Modern Black-box Optimization Algorithms to Problems in SiGe HBT Device Design (opens in a new tab)

  10. Signal processing algorithms for simplified-hardware multistatic synthetic aperture radar

    … a strategy is likely to approximate an upper performance bound; therefore a random strategy is likely to perform as well or better than any deterministic trajectory strategy. Finally, we expose connections between the Welti phase-coded radar sequences and the Discrete Wavelet transform. This …

    umn Repository record for Signal processing algorithms for simplified-hardware multistatic synthetic aperture radar (opens in a new tab)

  11. Signal Processing Algorithms for Simplified-Hardware Multistatic Synthetic Aperture Radar

    … a strategy is likely to approximate an upper performance bound; therefore a random strategy is likely to perform as well or better than any deterministic trajectory strategy. Finally, we expose connections between the Welti phase-coded radar sequences and the Discrete Wavelet transform. This …

    umn Repository record for Signal Processing Algorithms for Simplified-Hardware Multistatic Synthetic Aperture Radar (opens in a new tab)

  12. A role-assignment approach to state abstraction of Markov decision processes

    … enabling much more efficient planning, with the performance loss bounded by the approximation error. The previously known performance bound is based on the approximation errors indiscriminatively across all actions. We show that such a bound is too loose, and minimizing it does not necessarily …

    ubc Repository record for A role-assignment approach to state abstraction of Markov decision processes (opens in a new tab) Download PDF for A role-assignment approach to state abstraction of Markov decision processes (opens in a new tab)

  13. Synthesis of Optimal Arrays For MIMO and Diversity Systems

    … description of the impinging field and the array performance. A synthesis procedure is proposed which uses genetic algorithm optimization to optimally place a reduced number of dipoles. The results from this procedure demonstrate that using the framework in conjunction with optimization strategies …

    byu Repository record for Synthesis of Optimal Arrays For MIMO and Diversity Systems (opens in a new tab) Download PDF for Synthesis of Optimal Arrays For MIMO and Diversity Systems (opens in a new tab)

  14. Optimization of automated float glass lines

    … Unit First (LUF), and analyze the worst case performance of the algorithm in terms of the quality of solutions; the worst case performance bound is {1+(m-1)/m}+{1/3-1/(3m)} where m is the number of machines. It is 5/3 when m=2. For the real-world problem, we propose two different methods for …

    gatech Repository record for Optimization of automated float glass lines (opens in a new tab)

  15. Designing a scalable dynamic load -balancing algorithm for pipelined single program multiple data applications on a non-dedicated heterogeneous network of workstations

    … application characteristics, and load-balancing performance parameters are identified.;The dissertation presents a taxonomy that categorizes general load balancing algorithms and a methodology that facilitates creating new algorithms that can harness the HNOW computing power and still preserve …

    wvu Repository record for Designing a scalable dynamic load -balancing algorithm for pipelined single program multiple data applications on a non-dedicated heterogeneous network of workstations (opens in a new tab)

  16. Incremental Cluster Validity Indices and Their Role in Interpreting Lifelong Learning Systems

    … and applies these ideas to evaluating performance degradation in continual learning. The first study extends incremental cluster validity indices (iCVIs), enabling widely used validation metrics to operate in streaming environments. Experiments on synthetic and real-world datasets show …

    must-thes Repository record for Incremental Cluster Validity Indices and Their Role in Interpreting Lifelong Learning Systems (opens in a new tab)

  17. Diagnosing performance bottlenecks in HPC applications

    The software performance optimizations process is one of the most challenging aspects of developing highly performant code because underlying performance limitations are hard to diagnose. In many cases, identifying performance bottlenecks, such as latency stalls, requires a combination of fidelity …

    gatech Repository record for Diagnosing performance bottlenecks in HPC applications (opens in a new tab)

  18. Prioritized data synchronization with applications

    … of this protocol, with proved high-probability performance bound and fast-restart in logarithmic time. We also provide an empirical model for predicting the probability of complete synchronization as a function of time and symmetric differences. We then consider two applications of our core …

    bu Repository record for Prioritized data synchronization with applications (opens in a new tab)

Page 1 of 3