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 52 for “"Maximum coverage"”.

  1. Column generation approaches to patrol asset scheduling with complete and maximum coverage requirements

    … routing and scheduling patrol assets to provide coverage of a pre-defined set of patrol regions. Two patrol routing and scheduling problems are studied: the Patrol Boat Scheduling Problem with Complete Coverage (PBSPCC) and the Maximum Covering and Patrol Routing Problem (MCPRP). The PBSPCC …

    unsw Repository record for Column generation approaches to patrol asset scheduling with complete and maximum coverage requirements (opens in a new tab)

  2. ANALYSIS OF THE SERVICEMEMBERS' GROUP LIFE INSURANCE (SGLI) PROGRAM: BACKGROUND, CURRENT EFFECTIVENESS, AND FUTURE POLICY CONSIDERATIONS

    … recommendations for adequate life insurance coverage. As a result of our analysis of the SGLI program, we determined that up to 478,894 servicemembers, or 37% of active duty on-hand strength, have insufficient life insurance coverage through the SGLI program. Our team has recommended three …

    nps Repository record for ANALYSIS OF THE SERVICEMEMBERS' GROUP LIFE INSURANCE (SGLI) PROGRAM: BACKGROUND, CURRENT EFFECTIVENESS, AND FUTURE POLICY CONSIDERATIONS (opens in a new tab)

  3. Social distributed content caching in federated residential networks

    … content. We formulate this problem as a Budgeted Maximum Coverage (BMC) problem and we numerically compute the optimal content caching solution. We then propose a low-complexity, distributed heuristic algorithm and use simulation in a synthetic social network scenario to show that the final …

    poli-torino Repository record for Social distributed content caching in federated residential networks (opens in a new tab)

  4. Simulation of radiowave propagation in a dense urban environment

    … level. A second issue is base station antenna coverage. The antenna gain, half power beamwidth (HPBW), location, and pointing angle should be chosen to give the maximum coverage over a specified sector. Simulations can be used to select the optimums set of base station properties. Specifically …

    nps Repository record for Simulation of radiowave propagation in a dense urban environment (opens in a new tab)

  5. Combinatorial Optimization On Massive Datasets: Streaming, Distributed, And Massively Parallel Computation

    … two canonical examples of set cover and maximum coverage problems. We establish tight bounds on the space complexity of approximating set cover and maximum coverage in both single- and multi-pass streams, and build on these results to address the general problem of submodular maximization …

    penn Repository record for Combinatorial Optimization On Massive Datasets: Streaming, Distributed, And Massively Parallel Computation (opens in a new tab)

  6. Determining optimal flight paths for cellular network connectivity for the transmission of real-time physiological data in support of big data analytics during airborne critical care transport

    … This methodology consists of two main concepts: coverage map generation, and path planning. Coverage map generation creates a grid map of the total planning space that contains coverage information for each grid point. Coverage is calculated based on geographical and technical information …

    uoit Repository record for Determining optimal flight paths for cellular network connectivity for the transmission of real-time physiological data in support of big data analytics during airborne critical care transport (opens in a new tab)

  7. Semi-extractive multi-document summarization

    In this thesis, I design a Maximum Coverage problem with KnaPsack constraint (MCKP) based model for extractive multi-document summarization. The model integrates three measures to detect important sentences including Coverage, rewards sentences in regards to their representative level of the whole …

    lethbridge Repository record for Semi-extractive multi-document summarization (opens in a new tab)

  8. Key Views for Visualizing Large Spaces

    … such that (1) a given number of images can have maximum coverage on informative scenes; (2) a set of key views can be selected with certain continuity for representing the most distinct views. According to the scene visibility, continuity, and data redundancy, we evaluate viewpoints numerically …

    iupui Repository record for Key Views for Visualizing Large Spaces (opens in a new tab)

  9. Design, Synthesis and Evaluation of a Shape-Diverse Fragment Library

    … and Leeds libraries, that fulfil the criteria of maximum coverage of reference shapes as well as high shape-diversity. The synthesis of fragments based on Leeds chemistry is described in Chapter 3, focusing on four key chemistries established within the Nelson group, as well as the reselection of …

    whiterose Download PDF for Design, Synthesis and Evaluation of a Shape-Diverse Fragment Library (opens in a new tab)

  10. Ανάπτυξη συστήματος εκτάκτων καταστάσεων βασισμένο στην τεχνολογία DRM για υπηρεσίες πολιτικής προστασίας

    … technology and at the same time solves any radio coverage problems with the aforementioned standard, as it offsets the negative effect of internet failure and possible power outage to ensure the fast and safe transmission of the warning message. The units added to UNIWA - EIS as well as the …

    greece Repository record for Ανάπτυξη συστήματος εκτάκτων καταστάσεων βασισμένο στην τεχνολογία DRM για υπηρεσίες πολιτικής προστασίας (opens in a new tab)

  11. An Empirical Analysis of an Algorithm for the Budgeted Maximum Vertex Cover Problem in Trees

    … such as cost and resources. The Budgeted Maximum Vertex Cover is a generalization of covering problems. It models situations with constraints. In this thesis, we empirically analyze an algorithm for the problem of finding the Budgeted Maximum Vertex Cover in undirected trees (BMVCT). The …

    wvu Repository record for An Empirical Analysis of an Algorithm for the Budgeted Maximum Vertex Cover Problem in Trees (opens in a new tab)

  12. A Controlled Experiment on Coverage Maximization of Automated Model-Based Software Test Cases in the Automotive Industry

    … on how to write these tests in order to achieve maximum coverage. Objective: We evaluated our prototype CANoe+ which uses the CANoe and GraphWalker tools Vs CANoe with regard to coverage maximization of generated test cases from the viewpoint of both software developers and software testers. The …

    chalmers Repository record for A Controlled Experiment on Coverage Maximization of Automated Model-Based Software Test Cases in the Automotive Industry (opens in a new tab)

  13. Study of polypyrrole based biosensing systems by fluorescence methods /

    … of pH and ionic strength. Additionally, the maximum coverage of particle monolayers, which monotonically increased with ionic strength, was determined by SEM. The obtained data were in agreement with theoretical predictions derived from the random sequential adsorption (RSA) model. It was …

    vilnius Repository record for Study of polypyrrole based biosensing systems by fluorescence methods / (opens in a new tab)

  14. Polipirolu modifikuotų biologiniuose jutikliuose naudojamų sistemų tyrimas fluorescencijos metodais /

    … of pH and ionic strength. Additionally, the maximum coverage of particle monolayers, which monotonically increased with ionic strength, was determined by SEM. The obtained data were in agreement with theoretical predictions derived from the random sequential adsorption (RSA) model. It was …

    vilnius Repository record for Polipirolu modifikuotų biologiniuose jutikliuose naudojamų sistemų tyrimas fluorescencijos metodais / (opens in a new tab)

  15. A Resource-Constrained Coverage Protocol Over Urban VANETs

    … it presents a challenge to design a realistic coverage protocol for ve- hicular networks, due to the service requirements, assorted mobility patterns, resource constraints and irregularity of the service area. It is also a challenge to meet a high quality of coverage with a tight deployment …

    ottawa-retro Repository record for A Resource-Constrained Coverage Protocol Over Urban VANETs (opens in a new tab)

  16. Automatic visual sensemaking approach for the behavioral understanding of beef cattle

    … A method was developed to calculate the camera coverage in a 3D farm environment, and a genetic algorithm-based model was designed to find optimal placements of a multi-camera and multi-pen setup. The algorithm's objective was to maximize the multi-camera coverage while minimizing the budget. …

    iastate Repository record for Automatic visual sensemaking approach for the behavioral understanding of beef cattle (opens in a new tab)

  17. Wide-Area Surveillance System using a UAV Helicopter Interceptor and Sensor Placement Planning Techniques

    … optimally places perimeter cameras based on maximum coverage and minimal cost. Part of this planning system includes the MATLAB implementation of Erdem and Sclaroff’s Radial Sweep algorithm for visibility polygon generation. Additionally, 2-D camera modeling is proposed for both fixed and PTZ …

    ut-knoxville Repository record for Wide-Area Surveillance System using a UAV Helicopter Interceptor and Sensor Placement Planning Techniques (opens in a new tab)

  18. Σύγχρονες τεχνικές σχεδίασης και υλοποίησης συστήματος παραγωγής συνθετικής ομιλίας με επεξεργασία στο πεδίο του χρόνου

    … of the voice synthesizer and ensuring maximum coverage of different acoustic and linguistic phenomena. - The different subsystems of the speech synthesizer, which are responsible for natural language processing, text normalization and phonetic transcription of the text. New methods have …

    greece Repository record for Σύγχρονες τεχνικές σχεδίασης και υλοποίησης συστήματος παραγωγής συνθετικής ομιλίας με επεξεργασία στο πεδίο του χρόνου (opens in a new tab)

  19. Maximizing Sensor Coverage using Displacement to Remove Overlaps

    … and challenges. One of the main concerns is the coverage and redistribution of the sensors, without any overlap, in order to achieve maximum coverage with limited usage of energy. The first section of the paper gives a brief overview of the sensors, the sensor network, the various applications …

    ndsu Repository record for Maximizing Sensor Coverage using Displacement to Remove Overlaps (opens in a new tab)

Page 1 of 3