Sökning: "utilization bound"
Visar resultat 6 - 10 av 37 avhandlingar innehållade orden utilization bound.
6. Mathematical Modelling and Methods for Load Balancing and Coordination of Multi-Robot Stations
Sammanfattning : The automotive industry is moving from mass production towards an individualized production, individualizing parts aims to improve product quality and to reduce costs and material waste. This thesis concerns aspects of load balancing and coordination of multi-robot stations in the automotive manufacturing industry, considering efficient algorithms required by an individualized production. LÄS MER
7. Early-Decision Decoding of LDPC Codes
Sammanfattning : Since their rediscovery in 1995, low-density parity-check (LDPC) codes have received wide-spread attention as practical capacity-approaching code candidates. It has been shown that the class of codes can perform arbitrarily close to the channel capacity, and LDPC codes are also used or suggested for a number of important current and future communication standards. LÄS MER
8. Low Complexity Techniques for Low Density Parity Check Code Decoders and Parallel Sigma-Delta ADC Structures
Sammanfattning : Since their rediscovery in 1995, low-density parity-check (LDPC) codes have received wide-spread attention as practical capacity-approaching code candidates. It has been shown that the class of codes can perform arbitrarily close to the channel capacity, and LDPC codes are also used or suggested for a number of important current and future communication standards. LÄS MER
9. Probe-based admission control in IP networks
Sammanfattning : The current Internet design is based on a besteffortservice, which combines high utilization of network resourceswith simplicity. As a consequence of this design, the Internetis unable to provide guaranteed or predictable quality ofservice (QoS), required to offer realtime services thathave constraints on endtoend delay, delay jitterand packet loss. LÄS MER
10. Dynamic Cloud Resource Management : Scheduling, Migration and Server Disaggregation
Sammanfattning : A key aspect of cloud computing is the promise of infinite, scalable resources, and that cloud services should scale up and down on demand. This thesis investigates methods for dynamic resource allocation and management of services in cloud datacenters, introducing new approaches as well as improvements to established technologies. LÄS MER