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 49 for “"Near-optimality"”.

  1. Near-Optimality of Distributed Network Management with a Machine Learning Approach

    … a distributed algorithm would result in a near-optimal management. The other is the complexity, i.e., whether a distributed algorithm would scale gracefully with a network size. We study these issues through modeling, approximation, and randomized distributed algorithms. For near-optimality …

    gatech Repository record for Near-Optimality of Distributed Network Management with a Machine Learning Approach (opens in a new tab)

  2. Near-Optimality for Multi-action Multi-resource Restless Bandits with Many Arms

    … for problems with large $N$. We study the optimality gap, i.e., the loss in expected performance vs. that of the optimal policy, of such scalable policies. The tightest previous theoretical bounds, which apply only for a handful of carefully-designed policies, show that this optimality gap …

    cornell Repository record for Near-Optimality for Multi-action Multi-resource Restless Bandits with Many Arms (opens in a new tab)

  3. NEAR-OPTIMALITY AND ROBUSTNESS OF GREEDY ALGORITHMS FOR BAYESIAN POOL-BASED ACTIVE LEARNING

    … and deterministic hypothesis spaces, and (2) a near-optimality guarantee for greedy algorithms when maximizing pointwise monotone submodular functions. Using these tools, we analyze and prove novel theoretical properties of two commonly used greedy algorithms for active learning: the maximum …

    nus Repository record for NEAR-OPTIMALITY AND ROBUSTNESS OF GREEDY ALGORITHMS FOR BAYESIAN POOL-BASED ACTIVE LEARNING (opens in a new tab) Download file for NEAR-OPTIMALITY AND ROBUSTNESS OF GREEDY ALGORITHMS FOR BAYESIAN POOL-BASED ACTIVE LEARNING (opens in a new tab)

  4. On the Near-Optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling

    … List scheduling is generally regarded as being near-optimal in practice, provided a good choice of heuristic is used. However, previous work comparing a list scheduler against an optimal scheduler either makes the assumption that an idealized architectural model is being used or uses too few …

    waterloo Repository record for On the Near-Optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling (opens in a new tab)

  5. Per-flow cardinality estimation based on virtual LogLog sketching

    … evidence from both perspectives suggests the near-optimality of the vHLL estimator for per-flow estimation, analogous to the near-optimality of the HLL estimator for single-flow estimation.

    uiuc Repository record for Per-flow cardinality estimation based on virtual LogLog sketching (opens in a new tab)

  6. Provably Asymptotically Near-Optimal Motion Planning with Sparse Data Structures

    … this property, however, may grow too large. If optimality is relaxed,asymptotically near-optimal solutions produce sparser graphs by notincluding all edges. The idea stems from graph spanner algorithms,which produce sparse subgraphs that guarantee near-optimal paths.Existing asymptotically …

    unr Repository record for Provably Asymptotically Near-Optimal Motion Planning with Sparse Data Structures (opens in a new tab)

  7. Unbounded unimodal search and pursuit problems

    … search tree. The inequality is used to prove the near optimality of an algorithm for solving the unbounded discrete unimodal search problem. New results on the computational complexity of determining if capture is possible is obtained for discrete pursuit problems. Similar techniques lead to new …

    uiuc Repository record for Unbounded unimodal search and pursuit problems (opens in a new tab)

  8. Local Routing in Spanners Based on WSPDs

    … of the complete graph based on length into a linear number of sets. Among the many different applications of WSPDs, Callahan and Kosaraju proved that the sparse subgraph that results by selecting an arbitrary edge from each set (called WSPD-spanner) is a 1 + 8/(s − 4)-spanner, where s > 4 is the …

    ottawa-retro Repository record for Local Routing in Spanners Based on WSPDs (opens in a new tab)

  9. DISTRIBUTED SUBMODULAR OPTIMIZATION FOR A UXV NETWORKED CONTROL SYSTEM

    … to solve this problem. This approach gives near-optimality guarantees while reducing the complexity of the problem, allowing solutions to be found in near real-time. A simple, novel distributed submodular approach to NCS control was developed, with simulation and analysis provided for an …

    nps Repository record for DISTRIBUTED SUBMODULAR OPTIMIZATION FOR A UXV NETWORKED CONTROL SYSTEM (opens in a new tab)

  10. Robustness to Approximations and Model Learning in MDPs and POMDPs

    … conditions on the weak Feller property of non-linear filter kernels for the study of POMDPs. Establishing sufficient conditions for the weak Feller property for such processes is a significant problem, studied under various assumptions and setups in the literature. We provide a concise and …

    queens Repository record for Robustness to Approximations and Model Learning in MDPs and POMDPs (opens in a new tab)

  11. Optimal Zero-Delay Transmission of Markov Sources: Reinforcement Learning and Approximations

    … solutions which are guaranteed to achieve near-optimality. To this end, we formulate the problem as a Markov decision process (MDP) where the state is a probability-measure valued predictor/belief and the actions are quantizer maps. This MDP formulation has been used to show the optimality …

    queens Repository record for Optimal Zero-Delay Transmission of Markov Sources: Reinforcement Learning and Approximations (opens in a new tab)

  12. Information, complexity and structure in convex optimization

    … and the complexity of approximately solving linear systems of equations (equivalent to convex quadratic minimization) over Euclidean balls, under a matrix-vector multiplication oracle. Our work extends the applicability of lower bounds in two directions: Worst-Case Complexity of Large-Scale …

    gatech Repository record for Information, complexity and structure in convex optimization (opens in a new tab)

  13. Multiscale analysis for intensity and density estimation

    … that can produce highly accurate, piecewise linear approximations to images consisting of smooth regions separated by smooth boundaries. Polynomial- and platelet-based maximum penalized likelihood methods for signal and image analysis are both tractable and computationally efficient. …

    rice Repository record for Multiscale analysis for intensity and density estimation (opens in a new tab)

  14. A Dispatching Algorithm with Application to Fleets of Shared Autonomous Vehicles

    … to dominate the transport sector within a near future. For this to work efficiently—including the handling of spontaneous requests—the associated routing problems need to be modelled dynamically and solved efficiently. We formulate and model the problem of routing a fleet of shared …

    chalmers Repository record for A Dispatching Algorithm with Application to Fleets of Shared Autonomous Vehicles (opens in a new tab)

  15. An optimization model for strategic supply chain design under stochastic capacity disruptions

    … for scenario generation, a two-stage non-linear formulation and the Sample Average Approximation (SAA) procedure to solve the problem near optimality. We also propose a simple heuristic procedure to avoid the nonlinearity issue. The sampling and heuristic optimization procedures were …

    tamu Repository record for An optimization model for strategic supply chain design under stochastic capacity disruptions (opens in a new tab)

  16. Forklift Routing Optimization in a Warehouse using a Clustering-based Approach

    … The algorithm is able to solve the instances to near optimality quickly, finding practical solutions that could potentially be implemented into actual warehouses to reduce order picking time and hence, overall warehouse costs.

    concordia Download PDF for Forklift Routing Optimization in a Warehouse using a Clustering-based Approach (opens in a new tab)

  17. Zero-Delay Lossy Coding of Linear Vector Markov Sources with Applications to Networked Control

    … coding (quantization) of $\mathbb{R}^d$-valued linearly generated Markov sources under quadratic distortion. The structure and existence of deterministic and stationary coding policies that are optimal for the infinite horizon average cost (distortion) problem is established. Prior results …

    queens Repository record for Zero-Delay Lossy Coding of Linear Vector Markov Sources with Applications to Networked Control (opens in a new tab)

  18. Empirical detection for spread spectrum and code division multiple access (CDMA) communications

    … environments in a superior manner than the linear matched-filter despreader/detector, and done with reasonable amounts of training. Compared to the optimum detector, when known, the empirical detector always approaches optimal performance, again, with reasonable amounts of training. In an …

    rice Repository record for Empirical detection for spread spectrum and code division multiple access (CDMA) communications (opens in a new tab)

  19. Using simulated annealing to minimize the cost of multi-point lines in centralized computer networks : implementation for Windows 3.1

    … Alternatively, heuristics solve the problem to near-optimality with acceptable computational effort. We designed applications with graphical output capabilities for Windows 3.1$\sp{\rm TM}$ using simulated annealing (SA) in an attempt to improve upon well-known heuristic solutions. Our SA …

    concordia Download PDF for Using simulated annealing to minimize the cost of multi-point lines in centralized computer networks : implementation for Windows 3.1 (opens in a new tab)

  20. Mutli-objective trade-off exploration for Cyclo-Static and Synchronous Dataflow graphs

    … an evolutionary algorithm with an integer linear programming (ILP) model to jointly optimize throughput, area and latency for SDF graphs. The primary contributions of this work include: (1) extension of the ILP model to support CSDFGs with additional buffer size optimizations; (2) a further …

    texas Repository record for Mutli-objective trade-off exploration for Cyclo-Static and Synchronous Dataflow graphs (opens in a new tab)

Page 1 of 3