Sökning: "Dynamic Algorithm"
Visar resultat 16 - 20 av 396 avhandlingar innehållade orden Dynamic Algorithm.
16. Visualization of dynamic multibody simulation : with special reference to contacts
Sammanfattning : This thesis describes the requirements for creating a complete multibody visualization system. The complete visualization process includes everything from data storage to image rendering, and what is needed for a meaningful user-to-data interaction. LÄS MER
17. Approximate Solution Methods to Optimal Control Problems via Dynamic Programming Models
Sammanfattning : Optimal control theory has a long history and broad applications. Motivated by the goal of obtaining insights through unification and taking advantage of the abundant capability to generate data, this thesis introduces some suboptimal schemes via abstract dynamic programming models. LÄS MER
18. Contributions to quantitative dynamic contrast-enhanced MRI
Sammanfattning : Background: Dynamic contrast-enhanced MRI (DCE-MRI) has the potential to produce images of physiological quantities such as blood flow, blood vessel volume fraction, and blood vessel permeability. Such information is highly valuable, e.g., in oncology. LÄS MER
19. Constructive Newton–Puiseux Theorem, Sheaf Model of the Separable Closure and Dynamic Evaluation
Sammanfattning : Computing the Puiseux expansions of a plane algebraic curve defined by an affine equation over an algebraically closed field is a an important algorithm in algebraic geometry. This is the so-called Newton–Puiseux Theorem. The termination of this algorithm, however, is usually justified by non-constructive means. LÄS MER
20. Dynamic Resampling for Preference-based Evolutionary Multi-objective Optimization of Stochastic Systems : Improving the efficiency of time-constrained optimization
Sammanfattning : In preference-based Evolutionary Multi-objective Optimization (EMO), the decision maker is looking for a diverse, but locally focused non-dominated front in a preferred area of the objective space, as close as possible to the true Pareto-front. Since solutions found outside the area of interest are considered less important or even irrelevant, the optimization can focus its efforts on the preferred area and find the solutions that the decision maker is looking for more quickly, i. LÄS MER