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 5 of 5 for “"Probabilistic performance guarantees"”.

  1. CServ : an Internetwork architecture supporting mission-critical messaging with probabilistic performance guarantees

    … internetworking architecture that provides probabilistic, end-to-end quality of service guarantees to the data application for short critical messages prior to transmission. The class of critical network messages spans many applications in the civilian and defense network realms, including …

    mit Repository record for CServ : an Internetwork architecture supporting mission-critical messaging with probabilistic performance guarantees (opens in a new tab)

  2. Statistical models and decision making for robotic scientific information gathering

    … structure in scientific data, and have probabilistic performance guarantees. This thesis first introduces a novel sample selection algorithm for online, irrevocable sampling in data streams that have spatiotemporal structure, such as those that commonly arise in robotics and …

    woods-hole Repository record for Statistical models and decision making for robotic scientific information gathering (opens in a new tab)

  3. Statistical models and decision making for robotic scientific information gathering

    … structure in scientific data, and have probabilistic performance guarantees. This thesis first introduces a novel sample selection algorithm for online, irrevocable sampling in data streams that have spatiotemporal structure, such as those that commonly arise in robotics and …

    mit Repository record for Statistical models and decision making for robotic scientific information gathering (opens in a new tab)

  4. Studies on optimization problems with dynamically arriving information

    … computational evaluation methods, establishing performance bounds and comparisons to optimal solutions. It designs algorithmic frameworks for two dynamic optimization problems: the Online Order Batching, Sequencing, and picker Routing Problem (OOBSRP) in warehousing and the Traveling Salesman …

    passau-thes Repository record for Studies on optimization problems with dynamically arriving information (opens in a new tab)