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 192 for “"Optimal algorithm"”.

  1. Optimal algorithm design for transfer path planning for unmanned aerial vehicles

    … to address this shortcoming by developing optimal algorithms for a path planning task to move on to a circular flightpath to carry out a target tracking mission. The work is developed in three main sections. Firstly the transfer algorithm itself is derived including gradient analysis for …

    glasgow Download PDF for Optimal algorithm design for transfer path planning for unmanned aerial vehicles (opens in a new tab)

  2. Polynomial time optimal algorithm for stencil row planning in e-beam lithography

    … is believed hard as well, and no polynomial time optimal solution has been provided so far. Previous research formulates the problem as the travelling salesman problem, which is NP-hard and solves it by heuristics. In this thesis, we formulate the problem as a matching problem and propose a …

    uiuc Repository record for Polynomial time optimal algorithm for stencil row planning in e-beam lithography (opens in a new tab)

  3. Scheduling in two-machine robotic cell : an optimal algorithm based on buffering

    … We adopt analytical methods for determining the optimal cycle time of a two-machine robotic cell with a single buffer producing identical parts. We also evaluate the effectiveness of buffering in reducing the cycle time. We extend our research to the robotic cell producing multiple part types. We …

    concordia Download PDF for Scheduling in two-machine robotic cell : an optimal algorithm based on buffering (opens in a new tab)

  4. An Optimal Algorithm for Detecting Pattern Sensitive Faults in Semiconductor Random Access Memories

    … interference faults (APIFs) is presented. A test algorithm capable of detecting APIFs in RAMs requiring a minimum number of memory operations is then developed.

    ucf Repository record for An Optimal Algorithm for Detecting Pattern Sensitive Faults in Semiconductor Random Access Memories (opens in a new tab)

  5. Simulation and close-to-optimal algorithm for the static load balancing of a network of heterogeneous processors

    A close-to-optimal linear programming-based algorithm for the static load balancing of a network of heterogeneous processors is described and implemented. Experimental results suggest that the amount of time required by the implementation of the algorithm to balance the loads of the servers as a …

    njit Repository record for Simulation and close-to-optimal algorithm for the static load balancing of a network of heterogeneous processors (opens in a new tab)

  6. Innovative Opportunistic Scheduling Algorithms for Networks with Packet-Level Dynamics

    … an important factor in designing a scheduling algorithm to avoid severe starvation of certain users. Typical fairness involve processor sharing time fairness, proportional fairness, and minimum performance guarantee. On the other hand, delay performance is not a appropriate factor to evaluate …

    waterloo Repository record for Innovative Opportunistic Scheduling Algorithms for Networks with Packet-Level Dynamics (opens in a new tab)

  7. Scheduling shared data acquisition for real-time decision making

    … is first discussed with a corresponding optimal algorithm. Then, an improved heuristic algorithm based on the insights from the optimal algorithm of the sub-problem is presented. Finally, the new algorithm is evaluated with multiple scheduling parameters and is compared with previous …

    uiuc Repository record for Scheduling shared data acquisition for real-time decision making (opens in a new tab)

  8. Fast interconnect optimization

    … gate ASIC designs it is crucial to have fast algorithms in the design automation tools for many classical problems in the field to shorten time to market of the VLSI chip. This research presents algorithmic techniques and constructive models for two such problems: (1) Fast buffer insertion for …

    tamu Repository record for Fast interconnect optimization (opens in a new tab)

  9. Some combinational optimization problems on radio network communication and machine scheduling

    … perform distributed gossiping in asymptotically optimal time 0(D), where D is the diameter of the network. The simulation results show that most algorithms especially the randomized algorithm works very fast in practice. In the scheduling area, the first problem is online scheduling a set of …

    njit Repository record for Some combinational optimization problems on radio network communication and machine scheduling (opens in a new tab)

  10. ON PERIODIC REAL-TIME SCHEDULING ALGORITHMS

    … and generalized. The class of priority-driven algorithms is shown to be asymptotically optimal in time complexity. When tasks to be scheduled are dependent, an optimal algorithm and its characterization are devised and analyzed. A class of non-preemptive priority-driven algorithms for the …

    nebraska Repository record for ON PERIODIC REAL-TIME SCHEDULING ALGORITHMS (opens in a new tab)

  11. 2-sided and multi-sided stable matchings: structures, algorithms, and applications

    … problem. In the context of the SM, a time-optimal algorithm is provided that identifies which of the non-stable pairs can be removed from the agents' preference lists without altering the set of solutions. Then, using a directed line-graph to represent the SM, a sparse description of the SM …

    greece Repository record for 2-sided and multi-sided stable matchings: structures, algorithms, and applications (opens in a new tab)

  12. Implementation of time optimal digital control

    "This work deals with the implementation of time optimal digital control. The time optimal control algorithm that was used found the unconstrained control variable, u, and allowed the controller to saturate if the calculated control fell outside the allowable control region. The time optimal …

    missouri Repository record for Implementation of time optimal digital control (opens in a new tab)

  13. Who Pays? New York State Political Donor Matching with Machine Learning

    … first explored the best data processing and algorithmic parameters by which to match the donors. Once an optimal algorithm was generated, the donors were matched in two separate groups: organizations and individuals. The database that stores the matched donors is a product also of this …

    cuny-grad Repository record for Who Pays? New York State Political Donor Matching with Machine Learning (opens in a new tab)

  14. Optimal algorithms for experts and mixtures of Gaussians

    … can be cast as a sequential game between an algorithm and an adversary as follows. At each time step, an algorithm chooses one of n options (or experts) and the adversary sets a cost for each expert. The algorithm's goal is to minimize its regret, i.e. its cost relative to the best expert in …

    ubc Repository record for Optimal algorithms for experts and mixtures of Gaussians (opens in a new tab) Download PDF for Optimal algorithms for experts and mixtures of Gaussians (opens in a new tab)

  15. Optimal Allocation of Satellite Network Resources

    … allocation by exploring the application of an optimal algorithm to a subset of the general scheduling problem. Making some basic simplifications, such as the limitation of the mission scenarios to Low Earth Orbiting satellites, allows the effective application of the rigorous methods of the …

    vt Repository record for Optimal Allocation of Satellite Network Resources (opens in a new tab)

  16. Unequal Erasure Protection Techniques for Scalable Multi-Streams

    … all received source symbols are decoded. The R-D optimal redundancy allocation problem for M-UEP is formulated and its globally optimal solution is shown to have a time complexity of O(2^N N(L+1)^(N+1)), where N is the number of packets and L is the packet length. To address the high complexity of …

    mcmaster Repository record for Unequal Erasure Protection Techniques for Scalable Multi-Streams (opens in a new tab)

  17. An investigation of gate level design automation and global routing in VLSI design

    … logic gate level and practical global routing algorithms for VLSI design. An approach to performing automated design at the logic gate level is outlined. To verify this approach, an experimental sys tem was set up on an IBM-PC/AT, in an environment compatible with VIVID, an available integrated …

    ut-knoxville Repository record for An investigation of gate level design automation and global routing in VLSI design (opens in a new tab)

  18. Improving the convergence properties of sub-optimal turbo-equalisers

    … also important to reduce the complexity of the algorithms, so that the processing speed increases and the meterial resources are reduced to the minimum. Therefore sub-optimal algorithm are involved.This thesis is concerned with sub-optimal methods used in turbo-equalisation, especially focusing …

    adelaide Repository record for Improving the convergence properties of sub-optimal turbo-equalisers (opens in a new tab)

  19. Optimization Problems in Data Mining

    … orders. For the first, we give an efficient and optimal algorithm for finding all such claims. For the second, we give an algorithm whose running time is significantly more efficient than that of a naive one. Finally, we connect this boasting problem to that of finding a sequence of optimized …

    uiuc Repository record for Optimization Problems in Data Mining (opens in a new tab)

  20. TOPICS IN STATISTICAL MACHINE LEARNING

    … bandits with additive models. A near optimal algorithm is proposed and the minimax rate of regret is established. The results show an interesting phenomenon: the optimal regret is independent of the dimension if sparsity assumption is made, which highlights the difference between …

    penn Repository record for TOPICS IN STATISTICAL MACHINE LEARNING (opens in a new tab)

Page 1 of 10