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 354 for “"Computing time"”.

  1. An adjoint-based approach to computing time-domain sensitivity of multi-port systems described by reduced-order models

    … sensitivity analysis, which is concerned with computing the derivatives of various circuit performance metrics w.r.t. the circuit designable parameters. However, the increasing complexity of modern circuit design has made simulation and sensitivity analysis a computationally cumbersome task. …

    ottawa-retro Repository record for An adjoint-based approach to computing time-domain sensitivity of multi-port systems described by reduced-order models (opens in a new tab)

  2. Determination of Cycle Time Constraints in Case of Link Failure in Closed Loop Control in Internet of Things

    … of Things, it is crucial to study the real-time dependencies of the web, its failures and time delays. Today, smart grids, sensible homes, wise water networks, intelligent transportation, infrastructure systems that connect our world over are developing fast. The shared vision of such …

    ottawa-retro Repository record for Determination of Cycle Time Constraints in Case of Link Failure in Closed Loop Control in Internet of Things (opens in a new tab)

  3. Incremental kernel learning algorithms and applications.

    … the number of support vectors and requires less computing time. In addition the incremental revised SVR produces similar results with the standard SVR by reducing computing time significantly. Furthermore, the filter concept developed in this study may be utilized to reduce the computing time in …

    oklahoma-thes Repository record for Incremental kernel learning algorithms and applications. (opens in a new tab)

  4. ANN wave prediction model for winter storms and hurricanes

    … models require a prohibitive amount of computing time for simulating non-linear wave-wave interactions. Moreover, some parts of wind-wave generation processes are not fully understood yet. For this reason accurate predictions are not always guaranteed. In contrast, Artificial Neural …

    wm-mary Repository record for ANN wave prediction model for winter storms and hurricanes (opens in a new tab)

  5. Applications of Genetic Algorithms, Dynamic Programming, and Linear Programming to Combinatorial Optimization Problems

    … to solve, as they are NP-hard. No polynomial-time algorithm currently exists for solving them to optimality. Therefore, we are interested in developing high-quality heuristics that find near-optimal solutions in a reasonable amount of computing time. In this dissertation, we focus on …

    maryland Repository record for Applications of Genetic Algorithms, Dynamic Programming, and Linear Programming to Combinatorial Optimization Problems (opens in a new tab)

  6. A new and efficient method for generating minimal cut sets in fault free analysis

    … the presence of repeated events, thus minimizing computing time and storage requirements. The new method is amenable for hand calculations, as well as computer implementation, thus allowing very large fault trees to be handled in a fraction of the time required by conventional methods. A step by …

    carleton Repository record for A new and efficient method for generating minimal cut sets in fault free analysis (opens in a new tab)

  7. Improving Design Optimization and Optimization-based Design Knowledge Discovery

    … optimization requires a significant amount of computing time, especially when there are multiple design objectives to achieve. What’s more, there is a lack of studies in the current research on automatic generation of architectural design knowledge from optimization results. This paper presents …

    tamu Repository record for Improving Design Optimization and Optimization-based Design Knowledge Discovery (opens in a new tab)

  8. A new approach to slant stack processing: An X-window (OSF/motif) project

    … reconstruction of the original data. The computing time is faster than the conventional method for the same p traces made in the forward transform. Its applications presenting in this thesis have been satisfactory in seismic data processing.

    rice Repository record for A new approach to slant stack processing: An X-window (OSF/motif) project (opens in a new tab)

  9. The use of numerical methods in systems with chemical reaction and diffusion

    … and Galerkin's method the development in time of perturbations of these unstable states is explored. b) In the second example analysed it is shown that with appropriate kinetics, a chemical system, originally with a steady state in which composition and temperature are uniform, might …

    rice Repository record for The use of numerical methods in systems with chemical reaction and diffusion (opens in a new tab)

  10. A Tumor Cell Growth Model in a Nutrient Limited Environment

    … and the large amount of computational time required for one simulation limit the ability to fit the parameters. The variations in simulation results can be reduced by averaging repeated simulations. To do so in practical computing time, the simulations would have to be performed in …

    sdstate Repository record for A Tumor Cell Growth Model in a Nutrient Limited Environment (opens in a new tab)

  11. The Discrete 2D Fourier Transform In Polar Coordinates

    … counterpart, improvements are made to reduce the computing time.

    ottawa-retro Repository record for The Discrete 2D Fourier Transform In Polar Coordinates (opens in a new tab)

  12. Radar cross section synthesis for planar resistive surfaces

    … examined and their effect on the accuracy and computing time are discussed. Results are shown for both monostatic and bistatic RCS with arbitrary incident wave polarization.

    nps Repository record for Radar cross section synthesis for planar resistive surfaces (opens in a new tab)

  13. Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems

    … from O(n³) to O(n²). Therefore, it reduces the computing time at the expense of a slightly weaker lower bound. However, AKV' is observed to pay off as the instance size increases. By examining the gap for both the AKV and AKV' relaxations, we notice that both relaxations generate very small gaps …

    waterloo Repository record for Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems (opens in a new tab)

  14. A non Gaussian model for the lateral dose evaluation in hadrontherapy

    … pencil beams and the shortening of computation time for dose optimization and calculation. In this framework, the prediction of lateral dose distributions is a topic of great interest because currently, a Double Gaussian parametrization is typically used as approximation although other …

    lmu-germany Repository record for A non Gaussian model for the lateral dose evaluation in hadrontherapy (opens in a new tab)

  15. Time-sharing task control for a hybrid computer simulation laboratory

    The study of time sharing systems parameters and design is undertaken. Online and hybrid simulation programmer's demands for interactive digital computing time are time inefficient for modern high speed computers, hence the motivation for time shared computing systems. The techniques for achieving …

    nps Repository record for Time-sharing task control for a hybrid computer simulation laboratory (opens in a new tab)

  16. Initial Feasible Solutions of Three Dimensional Transportation Problems

    … the modified Schell procedure requires much less computing time and generally gives a feasible solution closer to the optimum solution.</p>

    ut-knoxville Repository record for Initial Feasible Solutions of Three Dimensional Transportation Problems (opens in a new tab)

  17. Computer Simulation of the Rotational Spectrum of a Symmetric Top Molecule

    … in several subroutine blocks. By doing this the computing time was reduced by 70% over similar programs. The program can be used to simulate the spectrum of a molecule if the transition polarization type and the rotational constants are known. However, if the type of transition polarization or …

    wku-diss Repository record for Computer Simulation of the Rotational Spectrum of a Symmetric Top Molecule (opens in a new tab)

  18. Computational Gains Via a Discretization of the Parameter Space in Individual Level Models of Infectious Disease

    … burden. Here we present new method to reduce the computing time cost in such MCMC analyses and study its usefulness. This method is based a round the discretization of the spatial parameters in the infectious disease model. A normal approximation of the posterior density of the output from the …

    guelph Repository record for Computational Gains Via a Discretization of the Parameter Space in Individual Level Models of Infectious Disease (opens in a new tab)

  19. Image Wavelet Compression Implementation Using a Run-Time Reconfigurable Custom Computing Machine

    … Gate Arrays (FPGAs) by using the run-time reconfigurable custom computing machine design tool Janus. The four routines implementing the IWC are discussed. The structure of Janus is introduced and the IWC implementation design framework to use Janus structure is described in detail. The …

    vt Repository record for Image Wavelet Compression Implementation Using a Run-Time Reconfigurable Custom Computing Machine (opens in a new tab)

Page 1 of 18