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 25 for “"Precomputing"”.

  1. Board game ai development using alpha-beta pruning /

    … alpha-beta pruning algorithm. This algorithm is precomputing game strategies for every possible step prior to next turn. The board game itself is an abstract type, thus do not have any random or luck based events and relies on player strategies. The game was created using Unity software. For …

    vilnius Repository record for Board game ai development using alpha-beta pruning / (opens in a new tab)

  2. Precomputational methods for efficient solution of constrained multibody dynamics.

    … deformable joints are developed for off-line precomputing. The special joint subspace projection technique is developed to incorporate relations between a set of equivalent joints and the original deformable joints. This technique can be a powerful tool in the engineering design process. In …

    arizona-thes Repository record for Precomputational methods for efficient solution of constrained multibody dynamics. (opens in a new tab)

  3. Performance improvements to peer-to-peer file transfers using network coding.

    … of the small number of elements in the field and precomputing results. We evaluate our approach through simulation and demonstrate that it may serve to allow for faster transfer times on a more robust peer-to-peer network.

    baylor Repository record for Performance improvements to peer-to-peer file transfers using network coding. (opens in a new tab)

  4. A novel approach to evaluating compact finite differences and similar tridiagonal schemes on GPU-accelerated clusters

    … on the cyclic reduction algorithm and show that precomputing forward reduction coefficients can be especially effective for obtaining good performance. Our tridiagonal solver is able to outperform the NVIDIA CUSPARSE and the multithreaded Intel MKL tridiagonal solvers on GPU and CPU respectively. …

    clemson Repository record for A novel approach to evaluating compact finite differences and similar tridiagonal schemes on GPU-accelerated clusters (opens in a new tab)

  5. Effective graph neural networks by overfitting and over-squashing mitigation

    … of perturbation-based graph learning by precomputing feature diffusion over perturbed graph views. Together, these contributions show that improving graph classification with MPNNs requires measuring over-squashing, designing principled augmentation frameworks to mitigate overfitting and …

    uoit Repository record for Effective graph neural networks by overfitting and over-squashing mitigation (opens in a new tab)

  6. Preemptive Placement and Routing for In-Field FPGA Repair

    … to repair FPGA devices with wear-out faults by precomputing a set of repair circuits that, collectively, can repair a fault found in any logic block of the FPGA. This approach relies on logic placement and routing to create “repair” circuits that avoid specific logic blocks. These repairs can be …

    byu Repository record for Preemptive Placement and Routing for In-Field FPGA Repair (opens in a new tab) Download PDF for Preemptive Placement and Routing for In-Field FPGA Repair (opens in a new tab)

  7. Surplus and Scarce Energy: Designing and Optimizing Security for Energy Harvested Internet of Things

    … true random number generation, and we show that precomputing improves energy efficiency and algorithm latency in both applications. Second, we analyze the security pitfalls in transiently powered devices. To secure transiently powered devices, we propose the Secure Intermittent Computing …

    vt Repository record for Surplus and Scarce Energy: Designing and Optimizing Security for Energy Harvested Internet of Things (opens in a new tab)

  8. Fixed-polynomial approximate spectral transformations for preconditioning the eigenvalue problem

    … There are significant computational benefits in precomputing an approximation to a spectral transformation, which become apparent in the discussion of implementation details as well as in the development of accuracy heuristics. Numerical experiments demonstrate that this preconditioning scheme is …

    rice Repository record for Fixed-polynomial approximate spectral transformations for preconditioning the eigenvalue problem (opens in a new tab)

  9. Improving Filtering for Computer Graphics

    … the rendering pipeline, I developed a method for precomputing image filters over 3D surfaces. If I can also change the pipeline, I show that it is possible to improve the quality of texture sampling significantly in real-time rendering while using the same memory bandwidth as used in traditional …

    tamu Repository record for Improving Filtering for Computer Graphics (opens in a new tab)

  10. RapidSCAT Slice Spatial Response Function Contour Parameterization

    … lengthy computation, which can be simplified by precomputing and tabulating key SRF contours. The tabular parameterization for many spinning scatterometers, i.e., QuikSCAT, is straight-forward. For RapidSCAT, this estimation is more involved than other radars due to the irregular orbit of its …

    byu Repository record for RapidSCAT Slice Spatial Response Function Contour Parameterization (opens in a new tab) Download PDF for RapidSCAT Slice Spatial Response Function Contour Parameterization (opens in a new tab)

  11. A methodology for automated lookup table optimization of scientific applications

    … can expedite function evaluation by precomputing and storing function results, thereby allowing inexpensive memory lookups to replace costly function calls. Practical concerns limit the size and accuracy of LUT data, thus the technique represents a tradeoff between error and …

    colostate Repository record for A methodology for automated lookup table optimization of scientific applications (opens in a new tab)

  12. Adaptive Real-Time Heterogeneous Scheduling for Streaming Applications: The Deep Learning Inference Use Case

    … optimal performance. This was achieved by precomputing schedulers that encompassed different device health stages. As device performance fluctuated, the appropriate scheduler is selected. The precomputation effectively shifted scheduler generation to the left and decoupled it from runtime …

    texas-state Repository record for Adaptive Real-Time Heterogeneous Scheduling for Streaming Applications: The Deep Learning Inference Use Case (opens in a new tab)

  13. Online and Hierarchical Agent Supervision

    … this process can be done incrementally, without precomputing the local refinements.

    york Repository record for Online and Hierarchical Agent Supervision (opens in a new tab)

  14. Prefetch mechanisms by application memory access pattern

    … look back at past history or look forward by precomputing an application's future requirements. Applications with a low compute-a ccess ratio an benefit from history-based prefetching if their access pattern is not too irregular. Applications with irregular access patterns may benefit from …

    texas Repository record for Prefetch mechanisms by application memory access pattern (opens in a new tab)

  15. Real-time planning and control for simulated bipedal locomotion

    … task in real-time. We then present a method for precomputing robust task-based control policies for physically simulated characters. This allows our characters to complete higher-level locomotion tasks, such as walking in a user specified direction, while interacting with the environment in …

    ubc Repository record for Real-time planning and control for simulated bipedal locomotion (opens in a new tab) Download PDF for Real-time planning and control for simulated bipedal locomotion (opens in a new tab)

  16. Computationally bounded rationality from three perspectives: precomputation, regret tradeoffs, and lifelong learning

    … each player can spend some time before the game precomputing (memorizing) strong moves from an oracle, but has limited memory to remember these moves. We show how to analytically quantify how randomly optimal strategies play in equilibrium, and give polynomial- time algorithms for computing a …

    oxford Repository record for Computationally bounded rationality from three perspectives: precomputation, regret tradeoffs, and lifelong learning (opens in a new tab)

  17. A Framework for Parallelizing OWL Classification in Description Logic Reasoners

    … and various parallel computing techniques for precomputing and classification to reduce the overhead of processing ontologies and compete with other DL reasoners based on the wall clock time for classification. In order to test the performance of both versions of our approaches, we use a …

    concordia Download PDF for A Framework for Parallelizing OWL Classification in Description Logic Reasoners (opens in a new tab)

  18. Improving the interpretation of metabolic pathfinding results with clustering and compound hubs

    … in the metabolic network. The ultimate goal of precomputing the lookup table is to reduce search space while still obtaining most, if not all, pathway results found by the original search algorithm. We provide evidence that this is a promising direction for future research and can yield results …

    rice Repository record for Improving the interpretation of metabolic pathfinding results with clustering and compound hubs (opens in a new tab)

  19. Tabulated and Data-Driven Modeling of High-Speed Turbulent Combustion

    … chemistry models (TCMs) address this by precomputing a library of thermochemical states and a single representative source term for use at simulation runtime, thereby reducing the number of transported scalars. Inherent to tabulated frameworks is the assumption of path-independence: every …

    umn Repository record for Tabulated and Data-Driven Modeling of High-Speed Turbulent Combustion (opens in a new tab)

Page 1 of 2