Sökning: "scheduling algorithm"
Visar resultat 1 - 5 av 200 uppsatser innehållade orden scheduling algorithm.
1. Using search based methods for beamforming
Uppsats för yrkesexamina på avancerad nivå, Uppsala universitet/Avdelningen för systemteknikSammanfattning : In accommodating the growing global demand for wireless, Multi-User Multiple-Input and Multiple-Output (MU-MIMO) systems have been identified as the key technology. In such systems, a transmitting basestation serves several users simultaneously, increasing the network capacity. LÄS MER
2. Optimizing the instruction scheduler of high-level synthesis tool
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : With the increasing complexity of the chip architecture design for meeting different application requirements, the corresponding instruction scheduler of high-level synthesis tool needs to solve complex scheduling problems. Dynamically Reconfigurable Resource Array (DRRA) is a novel architecture based on Coarse-Grained Reconfigurable Architecture (CGRA) on SiLago platform, the instruction scheduler of Vesyla-II, the dedicated High-Level Synthesis (HLS) tool targets for DRRA needs to schedule the specific instruction sets designed for Distributed Two-level Control System (D2LC). LÄS MER
3. Simultaneous scheduling of railway maintenance and trains : Modelling and solving train interactions close to a maintenance operation
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Rail transport plays a key role in the mobility of passengers and goods. It is expected to grow the decarbonization of society. In that context, it is important to use the railway network efficiently, and jointly planning trains and network maintenance allows for better use of resources. LÄS MER
4. Efficiently Solving the Exact Cover Problem in OpenMP
Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskapSammanfattning : The exact cover problem is an NP-complete problem with many widespread use cases such as crew scheduling, railway scheduling, benchmarking as well as having applications in set theory. Existing algorithms can be slow when dealing with large datasets however. LÄS MER
5. Prediktivt underhåll av transformatorstationer genom automatisk analys av störningsdata i COMTRADE-filer
M1-uppsats, KTH/Hälsoinformatik och logistikSammanfattning : Arbetet beskriver möjligheten att kunna utföra prediktivt underhåll med hjälp av information frånCOMTRADE störningsfiler. En mjukvarualgoritm som hämtar tidsförlopp för händelser som uppstårvid störningar och kan ge indikationer på ifall reläer eller strömbrytare faller utanför optimalaarbetsförhållanden har utvecklats. LÄS MER