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 7 of 7 for “"Interval constraints"”.
-
Global optimization using interval constraints
… the first to propose the bounding method using interval arithmetic for unconstrained global optimization. The first bounding method using interval arithmetic for constrained global optimization was due to E. R. Hansen and S. Sengupta. These methods are the well known bounding methods. Since …
-
Parallel constraint propagation
Interval constraints is a recently developed method used in numerical computation, and has many applications, such as solving systems of non-linear equations, complex function plotting, etc. An important aspect of solving a problem in terms of interval constraints is the constraint propagation …
-
Maximizing profits for a commercial salmon rearing facility using linear programming
… and salt water pens to construct in each time interval. Constraints are the volumes of facilities required and provided. Cost constraints are included. The model provides the best course of action for facilities expansion based on current knowledge in the salmon mariculture field. The …
-
Interactive exploration of numerical constraint satisfaction problems
… numerical computation is rounding error. Interval methods like interval arithmetic and interval constraints automatically compute an estimate of the error for each real number. These methods have proved to be valuable in numerical computation because of their certainty in the results. But …
-
Boundary Control For Automated Sweeping of Finite Element Meshes
… sources of skew: multiply-linked surfaces with interval constraints, and biased edge meshes. Two methods of lessening skew in surface meshes are then presented: the skew control algorithm, and the curve morphing algorithm. These algorithms are discussed in detail, with representative graphics. …
-
Interval methods for global optimization
We propose interval arithmetic and interval constraint algorithms for global optimization. Both of these compute lower and upper bounds of a function over a box, and return a lower and an upper bound for the global minimum. In interval arithmetic methods, the bounds are computed using interval …
-
Safe and Efficient Intelligent Intersection Control of Autonomous Vehicles
… position of a new head vehicle over a fixed time interval. Constraints from space conflicting vehicles are modeled using binary variables to represent the vehicle's future crossing behavior. The influence of immediate front vehicles of the vehicle of interest is also modeled as constraints in the …