Sökning: "Divide and Conquer algorithm"

Hittade 4 uppsatser innehållade orden Divide and Conquer algorithm.

  1. 1. Risk Measurement and Performance Attribution for IRS Portfolios Using a Generalized Optimization Method for Term Structure Estimation

    Master-uppsats, Linköpings universitet/Produktionsekonomi

    Författare :Fredrik Gerdin Börjesson; Christoffer Eduards; [2021]
    Nyckelord :Interest rate measurement; term structures; multiple yield curves; principal component analysis; systematic risk; risk factors; term structure simulation; Latin hypercube sampling with dependence; risk measurement; value-at-risk; expected shortfall; interest rate swap; performance attribution;

    Sammanfattning : With the substantial size of the interest rate markets, the importance of accurate pricing, risk measurement and performance attribution can not be understated. However, the models used on the markets often have underlying issues with capturing the market's fundamental behavior. LÄS MER

  3. 2. Investigation of dynamic control ML algorithms on existing and future Arm microNPU systems

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Joel Åhlund; David Cordesius; [2021]
    Nyckelord :Dynamic control; NPU; MTCNN; Machine learning; Neural networks; Technology and Engineering;

    Sammanfattning : In this thesis, dynamically controlled machine learning algorithms running on state of the art Arm microNPUs, with an attached Cortex-M CPU, were investigated. The machine learning framework used was Tensorflow and different subsets of it, such as Tensorflow Lite micro. LÄS MER

  4. 3. Network Densification and Energy Efficiency

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Sarthak Das; [2018]
    Nyckelord :Cell Sleep; Densification; Efficiency; Energy; Energy Model; FPLC; HetNet; Lean Carrier; LTE; Macro; Micro Sleep; OFDM; Power Model; PSI; Traffic; Technology and Engineering;

    Sammanfattning : The galloping pace of development in the field of wireless communication has left the world astounded over the last decade. But this has also led to a wild and inexcusable extravagant expenditure of energy. LÄS MER

  5. 4. TOP-K AND SKYLINE QUERY PROCESSING OVER RELATIONAL DATABASE

    Master-uppsats, JTH. Forskningsmiljö Informationsteknik

    Författare :Rafat Samara; [2012]
    Nyckelord :Top-k query; Skyline query; Fagin’s algorithm; Threshold Algorithm; No random access algorithm; Minimal Probing algorithm; Block-Nested-Loop algorithm; Nearest Neighbor algorithm; Branch and Bound Skyline Algorithm; Divide and Conquer algorithm;

    Sammanfattning : Top-k and Skyline queries are a long study topic in database and information retrieval communities and they are two popular operations for preference retrieval. Top-k query returns a subset of the most relevant answers instead of all answers. Efficient top-k processing retrieves the k objects that have the highest overall score. LÄS MER