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 11 of 11 for “"Bounding Methods"”.
-
Bounding Methods for Facilities Location Problems
<p>Several methods have been proposed and tested for calculating lower bounds on the objective function of facilities problems. These methods contribute to the efficiency of iterative solution methods by allowing the user to terminate the computation process when the objective function comes within …
-
New Bounding Methods for Global Dynamic Optimization
… global dynamic optimization. Firstly, new bounding and comparison results for dynamic process models are developed, which are more broadly applicable to engineering models than previous results. These new results show for the first time that in a state-of-the-art ODE relaxation framework, …
-
Global optimization using interval constraints
Global optimization methods can be classified into two non-overlapping classes with respect to accuracy: those with guaranteed accuracy and those without. The former are called bounding methods, the latter point methods. Bounding methods compute lower and upper bounds of function over a box and …
-
Ameliorating Systematic Errors in Full-Field AMCW Lidar
… closed-form and lookup table based inversion and bounding methods are explored. These methods include: sparse spike train deconvolution based multiple return separation, a closed-form inverse using attenuation ratios and a normalisation based lookup table method that uses a new property we term …
-
Sequential Decision-making Under Uncertainty: Novel Methodologies and Applications
… duals of the MSMIP. We propose two new bounding techniques based on stagewise and nonanticipative Lagrangian duals. Our proposal requires fewer assumptions than most existing MSMIP methods. Our numerical experiments demonstrate that the LDDR approaches yield significant optimality gap …
-
Accelerated Ray Traced Animations Exploiting Temporal Coherence
… for animations, the time is magnified. Many methods have been proposed to reduce the calculations necessary in ray tracing. Much of the effort has attempted to reduce the number of rays cast or to reduce the number of intersection calculations. Both of these techniques exploit spatial …
-
Typical case behaviour of spin systems in random graph and composite ensembles
… are solved by numerical integration and exact bounding methods. The multi-access channel problem is formulated as an equilibrium statistical physics problem for the case of bit transmission on a channel with power control and synchronisation. A sparse code division multiple access method is …
-
Identification of Mechanical Properties of Nonlinear Materials and Development of Tactile Displays for Robotic Assisted Surgery Applications
This PhD work presents novel methods of mechanical property identification for soft nonlinear materials and methods of recreating and modeling the deformation behavior of these nonlinear materials for tactile feedback systems. For the material property identification, inverse modeling method is …
-
Achieving Causal Fairness in Machine Learning
… To address this challenge, we propose novel bounding methods to accurately estimate the strength of unidentifiable fairness notions, including path-specific fairness, counterfactual fairness, and path-specific counterfactual fairness. Based on the estimation of fairness, we develop novel and …
-
Engineering-Economic Methods for Power Transmission Planning Under Uncertainty and Renewable Resource Policies
… The third essay describes a new, two-phase bounding and decomposition method to solve large-scale transmission and generation investment planning problems under various environmental constraints designed to incentivize high amounts of intermittent generation in electric power systems. The …
-
Interval methods for global optimization
… for the global minimum. In interval arithmetic methods, the bounds are computed using interval arithmetic evaluations. Interval constraint methods instead use domain reduction operators and consistency algorithms. The usual interval arithmetic algorithms for global optimization suffer from at …