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 86 for “"Asymptotically optimal"”.

  1. Asymptotically optimal shapes for counting lattice points and eigenvalues

    … stretching in the coordinate directions. The optimal domain is shown to be asymptotically balanced, meaning that the optimal stretch factor approaches 1 as the ""radius"" approaches infinity. In particular, the result implies when 1 < p < ∞ that among all p-ellipses (or Lamé curves), the …

    uiuc Repository record for Asymptotically optimal shapes for counting lattice points and eigenvalues (opens in a new tab)

  2. Asymptotically optimal path planning and surface reconstruction for inspection

    … we develop a novel analysis of asymptotic optimality of control-space sampling path planning algorithms. This analysis demonstrated that asymptotically optimal path planning for any Lipschitz continuous dynamical system can be achieved by sampling the control space directly. We also …

    mit Repository record for Asymptotically optimal path planning and surface reconstruction for inspection (opens in a new tab)

  3. Strongly Asymptotically Optimal Methods for the Pathwise Global Approximation of Stochastic Differential Equations with Coefficients of Super-linear Growth

    … and we seek approximations that are strongly asymptotically optimal in specific classes of approximations. For the supremum error, we prove strong asymptotic optimality for specific tamed Euler schemes relating to certain adaptive and to equidistant time discretizations. For the L_p error, we …

    passau-thes Repository record for Strongly Asymptotically Optimal Methods for the Pathwise Global Approximation of Stochastic Differential Equations with Coefficients of Super-linear Growth (opens in a new tab)

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

    Asymptotically optimal planners, such as PRM*, guarantee thatsolutions approach optimal as iterations increase. Roadmaps with 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 …

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

  5. Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets

    Consider the context of selecting an optimal system from among a finite set of competing systems, based on a "stochastic" objective function and subject to multiple "stochastic" constraints. In this context, we characterize the asymptotically optimal sample allocation that maximizes the rate at …

    vt Repository record for Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets (opens in a new tab)

  6. Functional quantization

    … and variable-rate quantization, we obtain asymptotically optimal quantizer point densities and bit allocations. Introducing the notions of functional typicality and functional entropy, we then obtain asymptotically optimal block quantization schemes for each component. Next, we address the …

    mit Repository record for Functional quantization (opens in a new tab)

  7. Analysis of some simple policies for dynamic resource allocation

    … allocation problem is formulated as a stochastic optimal control problem. Variants of a simple least load routing policy are shown to lead to a fluid type limit and to be asymptotically optimal. Either finite capacity constraints or migration of load can be incorporated into the setup.

    uiuc Repository record for Analysis of some simple policies for dynamic resource allocation (opens in a new tab)

  8. Combinatorial joint source-channel coding

    … setting where separation based schemes are optimal, and current solutions for applications requiring both lossy compression and noise resilience reflect this approach. However, in the adversarial setting, with worst case errors, separation based schemes are far from being even asymptotically

    mit Repository record for Combinatorial joint source-channel coding (opens in a new tab)

  9. Decontamination from Black Viruses Using Parallel Strategies

    … the spread (and the number of agents loss) asymptotically optimal. In the thesis, various protocols are proposed in meshes, tori, and chordal rings following the monotonicity principle (i.e., once a node is disinfected we prevent it from being recontaminated). Finally, a solution is proposed …

    ottawa-retro Repository record for Decontamination from Black Viruses Using Parallel Strategies (opens in a new tab)

  10. Constant composition deletion correcting codes

    … deletion correcting codes and show that they are asymptotically optimal and form an optimal coloring. There is a natural distance on compositions that provides a lower bound on deletion distance. Unrestricted deletion correcting codes can be constructed from the union of constant composition codes …

    uiuc Repository record for Constant composition deletion correcting codes (opens in a new tab)

  11. Maximum likelihood time-domain beamforming using simulated annealing

    … use the concept of maximum likelihood, which is asymptotically optimal. We show that improved resolution can be achieved using this new method.

    woods-hole Repository record for Maximum likelihood time-domain beamforming using simulated annealing (opens in a new tab)

  12. Essays on the Econometrics of Financial Data

    … distribution of jump height. I show the test is asymptotically optimal when the jump height is O(1/n^alpha) , the jump frequency is O(1/n^beta) where n is sample size, 3alpha+beta=2,alpha>1/2,beta>0. By constructing this optimal test, I derive the asymptotic power envelopes for testing continuous …

    wustl Repository record for Essays on the Econometrics of Financial Data (opens in a new tab)

  13. Efficiency loss in resource allocation games

    … welfare achieved at an economic equilibrium asymptotically optimal, as the number of market participants goes to infinity? Regarding the first topic, we quantify the efficiency loss in classical Cournot oligopoly games, where multiple oligopolists compete by choosing quantities. We also …

    mit Repository record for Efficiency loss in resource allocation games (opens in a new tab)

  14. A Hierarchical Algorithm for Probabilistically Complete Path Planning in Multi-Floor Environments

    … do not extend the guarantees on completeness and optimality provided by the underlying motion planning algorithms used within the 2D maps. This work proposes a new algorithm, HRG*, for probabilistically complete and asymptotically optimal multi-floor path planning that carries these guarantees, …

    mit Repository record for A Hierarchical Algorithm for Probabilistically Complete Path Planning in Multi-Floor Environments (opens in a new tab)

  15. ROAD : Rapid Optical Asteroid Detection

    … in video of the night sky. Tilt and the 3DRT are asymptotically optimal algorithms for the blind search problem, which seeks to identify near-Earth asteroids of arbitrary position and velocity using ground-based optical systems. In the process of establishing the optimality of these algorithms, we …

    mit Repository record for ROAD : Rapid Optical Asteroid Detection (opens in a new tab)

  16. Optimal and Suboptimal Signal Detection-On the Relationship Between Estimation and Detection Theory

    … of a Separating Function (SF) serves as the optimal decision statistic for the Uniformly Most Powerful (UMP) unbiased test. In many problems, the UMP test does not exist. For such cases, we introduce new suboptimal SF-Estimator Tests (SFETs) which are easy to derive for many problems. In the …

    queens Repository record for Optimal and Suboptimal Signal Detection-On the Relationship Between Estimation and Detection Theory (opens in a new tab)

  17. Some topics in sequential density estimation

    … distance. We show that these procedures are asymptotically optimal in a certain sense as w $\to$ 0.

    uiuc Repository record for Some topics in sequential density estimation (opens in a new tab)

  18. Complexity Analysis of Quantizations of Multidimensional Stochastic Differential Equations

    … we provide a method which yields a strongly asymptotically optimal sequence of N-quantization of X. In certain special cases our method is fully constructive and the algorithm is easy to implement.

    passau-thes Repository record for Complexity Analysis of Quantizations of Multidimensional Stochastic Differential Equations (opens in a new tab)

  19. Design and analysis of spherical codes

    … Both constructions result in codes that are asymptotically optimal with respect to minimum distance, and the first construction can be efficiently used as part of a vector quantizer for a memoryless Gaussian source. Both constructions are structured so that codepoints may be identified …

    uiuc Repository record for Design and analysis of spherical codes (opens in a new tab)

  20. Dynamic optimization in the age of big data

    … sample paths are obtained, we prove that the optimal cost of the robust problem converges to that of the underlying stochastic problem. To the best of our knowledge, this is the first data-driven approach for multi-stage stochastic linear optimization problems which is asymptotically optimal

    mit Repository record for Dynamic optimization in the age of big data (opens in a new tab)

Page 1 of 5