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 50 for “"dynamic program"”.
-
Scalable Automated Methods for Dynamic Program Analysis
… have developed tools for testing both C and Java programs. We have used the tools to find bugs in several real-world software systems including SGLIB, a popular C data structure library used in a commercial tool, implementations of the Needham-Schroeder protocol and the TMN protocol, the scheduler …
-
A dynamic program for minimum cost ship routing under uncertainty
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Ocean Engineering, 1978
-
Economically Optimal Integrated Pest Management Strategies for Control of Corn Rootworm and Soybean Cyst Nematode (Dynamic Program)
Embargo set by: Seth Robbins for item 70027 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs
-
Optimization of influenza vaccine strain selection
… selection problem as a discrete-time stochastic dynamic program with a high-dimensional continuous state space. We discuss the techniques that were developed for solving this difficult dynamic program, and present an effective and robust heuristic policy. We compare the performance of the …
-
Real-time maneuvering decisions for autonomous air combat
… range air combat is an extremely difficult and dynamic aerial task which presents many challenges for an autonomous UAS. An agile, unpredictable, and possibly human-piloted adversary, coupled with a complex and rapidly changing environment, creates a problem that is difficult to model and solve. …
-
Computational Techniques for Stochastic Reachability
… control formulation that requires solving a dynamic program, and which scales exponentially in the dimension of the state space. Second, almost no results exist for extending stochastic reachability analysis to systems with incomplete information, such that the controller does not have access …
-
Dynamic order allocation for make-to-order manufacturing networks : an industrial case study of optimization under uncertainty/
… realism and usability. The problem is cast as a Dynamic Program with a detailed model of demand uncertainty. Decisions include planning production over time, from a few hours to a quarter year, and determining the appropriate amount of labor at each factory. The objective is to minimize shipping …
-
Utilizing the notion of removable blocks to enhance program slicing algorithms
Program slicing is a program decomposition technique that transforms a large program into a smaller one that contains only statements relevant to the computation of a selected function. Applications of program slicing can be found in software testing, debugging and maintenance where program slicing …
-
Dynamic Programming Decomposition Methods For Capacity Allocation And Network Revenue Management Problems
… we develop decomposition-based approximate dynamic programming methods for problems in capacity allocation and network revenue management. Noting that the dynamic programming formulation of these problems suffers from the “curse of dimensionality”, we demonstrate that a set of …
-
Exploring Hybrid Dynamic and Static Techniques for Software Verification
… several hybrid techniques that explore dynamic (with program execution), static (without program execution) as well as the synergies of multiple approaches in software verification from the perspectives of testing and model checking. For software testing, a new simulation-based internal …
-
Mutual information based tracking with mobile sensors
… the sensor nodes. We present an approximate dynamic programming approach to a tracking problem with mobile sensor nodes. We utilize mutual information as the objective for optimal sensor placement. We show how a constrained dynamic programming approach allows us to balance estimation quality …
-
Economic comparisons of thinning from above and below in Loblolly Pine plantations using dynamic programming
… below were compared using an economic optimizing dynamic program, FORTE (Arthaud 1986). Economically optimal (net present value maximizing) thinning regime and rotation age were determined for benchmark economic and model inputs. Sensitivity of net present value and optimal management regime were …
-
An approximate dynamic programming approach to risk sensitive control of execution costs
… study the problem of optimal execution within a dynamic programming framework. Given an exponential objective function, system variables which are normally distributed, and linear market dynamics, we derive a closed form solution for optimal trading trajectories. We show that a trader lacking …
-
A multiple secretary problem with switch costs
… qualified one at a constant switch cost. A dynamic program is formulated and the optimal selection rule for the single secretary case is solved. An approximate solution is given for the multiple secretary case, in which we are allowed to have more than one secretary at a time. An experiment …
-
A dynamic multi-criteria analysis of spent-nuclear-fuel alternatives
… multiple-objective fuel allocation problem. Goal programming is selected as an appropriate modeling technique for both generic models. The spent-nuclear-fuel-allocation problem is further decomposed into a dynamic program with a goal program at each stage. The objectives are to allocate R&D funds …
-
Information theoretic sensor management
… problems of this type can be formulated as a dynamic program, the state space of the program is in general infinite, and traditional solution techniques are inapplicable. Despite this fact, many authors have applied simple heuristics such as greedy or myopic controllers with great success. …
-
Revenue optimization for a hotel property with different market segments : demand prediction, price selection and capacity allocation
… these predictions into a mixed integer linear program (MILP) to optimize prices and capacity allocations at the same time. We prove that the MILP can be equivalently solved as a linear program, and then show that it produces upper and lower bounds for the expected revenue maximization Dynamic …
-
Impact Analysis for AspectJ - A Critical Analysis and Tool-Based Approach to AOP
Aspect-Oriented Programming (AOP) has been promoted as a solution for modularization problems known as the tyranny of the dominant decomposition in literature. However, when analyzing AOP languages it can be doubted that uncontrolled AOP is indeed a silver bullet. The contributions of the work …
-
Polyhedra Study of Mixed Integer Programs With Variable Upper Bounds
… dependent lifting for this set and present a dynamic program for calculating lifting coefficients. Then we consider projections of this set to knapsack cover and to the single binary variable polytope. We present the result of sequence independent lifting of the knapsack cover inequality and …
-
A scalable mixed-level approach to dynamic analysis of C and C++ programs
… task of constructing robust and scalable dynamic program analysis tools for programs written in memory-unsafe languages such as C and C++, especially those that are interested in observing the contents of data structures at run time. In this thesis, I first introduce my novel mixed-level …
Page 1 of 3