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 33 for “"Approximation schemes"”.
-
Algorithms and approximation schemes for machine scheduling problems
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Faster fully polynomial approximation schemes for Knapsack problems
A fully polynomial time approximation scheme (FPTAS) is an algorithm that returns ... -optimal solution to a maximization problem of size n, which runs in polynomial time in both ... We develop faster FPTASs for several classes of knapsack problems. In this thesis, we will first survey the relevant …
-
Fast approximation schemes for multi-criteria combinatorial optimization
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992.
-
Fully polynomial time approximation schemes for sequential decision problems
… the common theme of fully polynomial time approximation schemes. In the first part, we introduce a generic approach for devising fully polynomial time approximation schemes for a large class of problems that we call list scheduling problems. Our approach is simple and unifying, and many …
-
Near-optimal data-driven approximation schemes for joint pricing and inventory control models
The thesis studies the classical multi-period joint pricing and inventory control problem in a data-driven setting. In the problem, a retailer makes periodic decisions of the prices and inventory levels of an item that the retailer wishes to sell. The objective is to match the inventory level with …
-
Stochastic approximation schemes for stochastic optimization and variational problems: adaptive steplengths, smoothing, and regularization
Stochastic approximation (SA) methods, first proposed by Robbins and Monro in 1951 for root- finding problems, have been widely used in the literature to solve problems arising from stochastic convex optimization, stochastic Nash games and more recently stochastic variational inequalities. Several …
-
Well-posedness questions and approximation schemes for a general class of functional differential equations
In this paper we consider approximation schemes and questions of well-posedness for a general class of functional differential equations of neutral-type (NFDE) where the difference operator does not have an atom at zero. Equations of this type occur in the modeling of certain aeroelastic control …
-
Analysis and Approximation of Viscoelastic and Thermoelastic Joint-Beam Systems
… Boltzmann, and thermoelastic damping. Approximation schemes will also be introduced. Finally, we look at optimal control for the Kelvin-Voigt model using a linear feedback regulator.
-
Algorithms for discrete, non-linear and robust optimization problems with applications in scheduling and service operations
… we present a general framework for designing approximation schemes for combinatorial optimization problems in which the objective function is a combination of more than one function. Examples of such problems include those in which the objective function is a product or ratio of two or more …
-
Dynamic compensators for a nonlinear conservation law
… then applied to the nonlinear model. Different approximation schemes are used to design suboptimal active feedback controllers. This approach provides important practical information. In particular, we show how functional gains can be used to locate new sensors. Numerical results are given to …
-
Approximate solution methods for partially observable Markov and semi-Markov decision processes
We consider approximation methods for discrete-time infinite-horizon partially observable Markov and semi-Markov decision processes (POMDP and POSMDP). One of the main contributions of this thesis is a lower cost approximation method for finite-space POMDPs with the average cost criterion, and its …
-
Compensator design for a system of two connected beams
… for such systems when standard finite element schemes are used to discretize the problem. We are particularly interested in the analysis of the uniformly exponential stability of the corresponding closed - loop systems resulting from the finite dimensional compensators. A specific multiple …
-
Dynamic multilevel graph layout and visualisation
… of 40% compared to the popular Barnes Hut Octree approximation method. Secondly, optimisation methods used in static graph drawing (such as multilevel and approximation schemes) are adapted for use in dynamic graph drawing, simultaneously improving the quality of layouts produced and reducing the …
-
Combinatorial optimization problems with concave costs
… bound, a variety of polynomial-time heuristics, approximation algorithms, and exact algorithms for classical combinatorial optimization problems immediately yield polynomial-time heuristics, approximation algorithms, and fully polynomial-time approximation schemes for the corresponding concave …
-
The bidimensionality theory and its algorithmic applications
… efficient fixed-parameter algorithms and approximation algorithms for NP- hard graph problems in broad classes of graphs. This theory applies to graph problems that are bidimensional in the sense that (1) the solution value for the k x k grid graph (and similar graphs) grows with k, …
-
Scalable, Efficient, and Fair Algorithms for Structured Convex Optimization Problems
… algorithms with theoretical guarantees on approximation quality and running time. We analyze the bit complexity and stability of efficient algorithms for problems including linear regression, $p$-norm regression, and linear programming by showing that a common subroutine, inverse …
-
Quantile Inference and Change Point Test under Time Series Non-stationarity
… New uniform Bahadur representations and Gaussian approximation schemes are established for a wide class of non-stationary and long memory linear processes. Furthermore, an asymptotic distributional theory is developed for the maxima of a class of non-stationary long memory Gaussian processes. With …
-
On qualitative properties and convergence of time-discretization methods for semigroups
… their proofs, including results on multi-step schemes and variable step-sizes. We also generalize a basic result on the rate of convergence of rational approximation schemes for semigroups. We obtain convergence results on a continuum of intermediate spaces between the Banach space <i>X</i> and …
-
Modeling and Estimation of Motion Over Manifolds with Motion Capture Data
… estimates is also provided in this study. The approximation methods are then implemented to estimate forward kinematics using motion capture data of a human running along a treadmill. The final study of this dissertation contains an examination of the continuous time regression problem over …
-
The study of many-electron systems
Various methods and approximation schemes are used to study many-electron interacting systems. Two important many-particle models, the Anderson model and the Hubbard model, and their electromagnetic properties have been investigated in many parameter regimes, and applied to physical systems. An …
Page 1 of 2