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 368 for “"computation time"”.

  1. ENHANCED COMPUTATION TIME FOR FAST BLOCK MATCHING ALGORITHM

    … studies on video compression have focused on multimedia transmission, videophones, teleconferencing, high definition television (HDTV), CD-ROM storage, etc. The idea of compression techniques is to remove the redundant information that exists in the video sequences. Motion compensated predictive …

    liverpool-jm Repository record for ENHANCED COMPUTATION TIME FOR FAST BLOCK MATCHING ALGORITHM (opens in a new tab)

  2. Economic allocation of computation time with computation markets

    Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.

    mit Repository record for Economic allocation of computation time with computation markets (opens in a new tab)

  3. Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method

    … of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. There are several existing path planning methods such as Visibility Graph (VG), Voronoi Diagram (VD), Potential Fields (PF) and …

    uthm Repository record for Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method (opens in a new tab)

  4. Bringing Probabilistic Real-Time Guarantees to the Real World

    Stochastic analysis of real-time systems has received a remarkable attention in the past few years. In general, this analysis has been mainly focused on sets of applications competing for a shared CPU and assuming independence in the computation and inter-arrival times of the jobs composing the …

    trento Repository record for Bringing Probabilistic Real-Time Guarantees to the Real World (opens in a new tab)

  5. Design of Minimal Programmable Logic Arrays

    … For the automated design of PLA's, we need computationally efficient procedures that can minimize functions of a large number of variables. For this type of function, the commonly used procedures cannot be applied either because they take too much computation time or because they require too …

    uiuc Repository record for Design of Minimal Programmable Logic Arrays (opens in a new tab)

  6. Real-Time Roadway Mapping and Ground Robotic Path Planning Via Unmanned Aircraft

    … images was used to improve performance and computation time. Road detection using k-means segmentation and binary image morphing was applied to aerial imagery with image shifting tracked by the mosaicking to develop a large road map. Improvements to computation time were developed using …

    vt Repository record for Real-Time Roadway Mapping and Ground Robotic Path Planning Via Unmanned Aircraft (opens in a new tab)

  7. A FEATURES EXTRACTION WRAPPER METHOD FOR NEURAL NETWORKS WITH APPLICATION TO DATA MINING AND MACHINE LEARNING

    … The major aim of this method is to reduce the computation time that is consumed during the implementation of the process of features selection and classifier optimization in the Heuristic for Features Selection (HVS) method. The HVS technique is a neural network based features selection …

    siu-theses Repository record for A FEATURES EXTRACTION WRAPPER METHOD FOR NEURAL NETWORKS WITH APPLICATION TO DATA MINING AND MACHINE LEARNING (opens in a new tab)

  8. ΜΕΛΕΤΗ ΟΡΘΟΓΩΝΙΚΩΝ ΚΑΙ ΤΡΙΓΩΝΙΚΩΝ ΜΙΚΡΟΤΑΙΝΙΑΚΩΝ ΚΕΡΑΙΩΝ

    … POINT HAVE BEEN TAKEN INTO ACCOUNT. THE REQUIRED COMPUTATION TIME IS THE MINIMUM POSSIBLE BECAUSE THE DESIRED QUANTITIES ARE GIVEN IN ANALYTICAL FORM. ESPECIALLY THE TRIANGULAR MICROSTRIP PATCH ANTENNAS HAVE BEEN STUDIED UNTIL NOW ONLY BY THE USE OF NUMERICAL METHODS ASTHE MOMENT METHOD AND THE …

    greece Repository record for ΜΕΛΕΤΗ ΟΡΘΟΓΩΝΙΚΩΝ ΚΑΙ ΤΡΙΓΩΝΙΚΩΝ ΜΙΚΡΟΤΑΙΝΙΑΚΩΝ ΚΕΡΑΙΩΝ (opens in a new tab)

  9. Development of a Hybrid Particle Continuum Solver

    … of physical accuracy requires large amounts of computation time. If the simulated flow is in collisional equilibrium, then less computationally intensive continuum methods, otherwise known as fluid methods, can be utilized. Hybrid Particle-Continuum (HPC) codes attempt to blend particle and …

    calpoly Repository record for Development of a Hybrid Particle Continuum Solver (opens in a new tab)

  10. Time-efficient Evacuation Routing Algorithm Incorporating Contraflow

    … achieve an effective evacuation plan, evacuation time and computation time need to be short. In this thesis two aspects of evacuation algorithms are discussed: minimum time evacuation using contraflow and minimum time using evacuation routing planning. To make evacuation time shorter by using …

    sdstate Repository record for Time-efficient Evacuation Routing Algorithm Incorporating Contraflow (opens in a new tab)

  11. The Application of Improved Numerical Techniques to 1-D Micellar/Polymer Flooding Simulation

    … simulator. By using a semi-discrete method, the time step size can be controlled and varied to be as large as pos-sible without sacrificing accuracy. The stability limit can also be detected with this method. The method is tested and compared with the fully discrete method in various conditions …

    texas Repository record for The Application of Improved Numerical Techniques to 1-D Micellar/Polymer Flooding Simulation (opens in a new tab)

  12. A computational visual saliency model for images.

    … deal with high-resolution images and real-time videos and it is a challenge to process this excessive amount of information with limited computational resources. Employing saliency models in these applications will limit the processing of irrelevant information and further will improve …

    rgu Repository record for A computational visual saliency model for images. (opens in a new tab)

  13. A new method for calculating the flow field in a dump combustor

    … incompressible flow. A great savings in computation time and computer storage is obtained with no observable compromise in accuracy.

    vt Repository record for A new method for calculating the flow field in a dump combustor (opens in a new tab)

  14. Routing algorithms in the physical design of VLSI circuits

    … of test circuits using reasonable amount of computation time.

    uiuc Repository record for Routing algorithms in the physical design of VLSI circuits (opens in a new tab)

  15. Surrogate Neural Networks for Efficient Simulation-based Trajectory Planning Optimization

    … in the form of neural networks to reduce the computation time of simulation-based optimization of a reference trajectory. Simulation-based optimization is necessary when there is no analytical form of the system accessible, only input-output data that can be used to create a surrogate model of …

    mit Repository record for Surrogate Neural Networks for Efficient Simulation-based Trajectory Planning Optimization (opens in a new tab)

  16. Development of expert systems as on-line operational aids

    … on the quality of the knowledge base and the computational efficiency. Besides validating the knowledge base, computation time is analyzed. Based on discrimination nets, used in many production system languages for pattern matching efficiency, a method is proposed to obtain the worst case …

    washington Repository record for Development of expert systems as on-line operational aids (opens in a new tab)

  17. Modeling and characterization of elastic wave propagation in micro-scale photonic crystals

    … of the plane wave expansion method reduced the computation time from 18 hours, using Fortran running on a Unix environment with eight parallelized processors, to 1 minute using Matlab running on a simple windows machine. The computation time was more than 1000 times faster than that using the …

    unm Repository record for Modeling and characterization of elastic wave propagation in micro-scale photonic crystals (opens in a new tab)

  18. Switch-Level Timing Simulation of Mos Vlsi Circuits

    … of the circuits with a reasonable expenditure of computation time even for very large circuits. The algorithms presented in this thesis can handle only n-channel MOS (NMOS) circuits, but are easily extendible to handle complementary MOS (CMOS) circuits as well.

    uiuc Repository record for Switch-Level Timing Simulation of Mos Vlsi Circuits (opens in a new tab)

Page 1 of 19