11 
Towards next generation logic programming systems /Bansal, Ajay, January 2007 (has links)
Thesis (Ph.D.)University of Texas at Dallas, 2007. / Includes vita. Includes bibliographical references (leaves 105110)

12 
Multistage quadratic stochastic programming /Lau, Karen Karman. January 1999 (has links)
Thesis (Ph. D.)University of New South Wales, 1999. / Also available online.

13 
Development of controlled computational experiments on integer linear programming proceduresLin, Benjamin WeiYuh 12 1900 (has links)
No description available.

14 
An investigation of an exterior point method for linear programmingPudwill, Rodger A. 12 1900 (has links)
No description available.

15 
Linearly constrained nonlinear programming : a conjugate directions approachBouzaher, Abdelaziz 12 1900 (has links)
No description available.

16 
Quadratic programming : quantitative analysis and polynomial running time algorithmsBoljunčić, Jadranka January 1987 (has links)
Many problems in economics, statistics and numerical analysis can be formulated as the optimization of a convex quadratic function over a polyhedral set. A polynomial algorithm for solving convex quadratic programming problems was first developed by Kozlov at al. (1979). Tardos (1986) was the first to present a polynomial
algorithm for solving linear programming problems in which the number of arithmetic steps depends only on the size of the numbers in the constraint matrix and is independent of the size of the numbers in the right hand side and the cost coefficients. In the first part of the thesis we extended Tardos' results to strictly convex quadratic programming of the form max {cTx½xTDx : Ax ≤ b, x ≥0} with D being symmetric positive definite matrix. In our algorithm the number of arithmetic steps is independent of c and b but depends on the size of the entries of the matrices A and D.
Another part of the thesis is concerned with proximity and sensitivity of integer and mixedinteger quadratic programs. We have shown that for any optimal solution z̅ for a given separable quadratic integer programming problem there exist an optimal solution x̅ for its continuous relaxation such that / z̅  x̅ / ∞≤n∆(A) where n is the number of variables and ∆(A) is the largest absolute subdeterminant of the integer constraint matrix A . We have further shown that for any feasible solution z, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution z̅ having greater objective function value and with / z  z̅ / ∞≤n∆(A). Under some additional assumptions the distance between a pair of optimal solutions to the integer quadratic programming
problem with right hand side vectors b and b', respectively, depends linearly on / b — b' / ₁. The extension to the mixedinteger nonseparable quadratic case is also given.
Some sensitivity analysis results for nonlinear integer programming problems are given. We assume that the nonlinear 0 — 1 problem was solved by implicit enumeration and that some small changes have been made in the right hand side or objective function coefficients. We then established what additional information to keep in the implicit enumeration tree, when solving the original problem, in order to provide us with bounds on the optimal value of a perturbed problem. Also, suppose that after solving the original problem to optimality the problem was enlarged by introducing a new 0 — 1 variable, say xn+1. We determined a lower bound on the added objective function coefficients for which the new integer variable xn+1 remains at zero level in the optimal solution for the modified integer nonlinear program. We discuss the extensions to the mixedinteger case as well as to the case when integer variables are not restricted to be 0 or 1. The computational results for an example with quadratic objective function, linear constraints and 0—1 variables are provided.
Finally, we have shown how to replace the objective function of a quadratic program
with 0—1 variables ( by an integer objective function whose size is polynomially bounded by the number of variables) without changing the set of optimal solutions. This was done by making use of the algorithm given by Frank and Tardos (1985) which in turn uses the simultaneous approximation algorithm of Lenstra, Lenstra and Lovász (1982). / Business, Sauder School of / Graduate

17 
A documentation/development model for extending the instruction set of a minicomputerAlam, Shah Farooq January 2010 (has links)
Typescript, etc. / Digitized by Kansas Correctional Industries

18 
Stochastic programs and their value over deterministic programsCorrigall, Stuart January 1998 (has links)
A dissertation submitted to the Faculty of Arts, University of the Witwatersrand,
Johannesburg, in fulfilment of the requirements for the degree of Master of Arts. / Reallife decisionmaking problems can often be modelled by mathematical programs (or
optimization models). It is common for there to be uncertainty about the parameters of
such optimization models. Usually, this uncertainty is ignored and a simplified
deterministic program is obtained. Stochastic programs take account of this uncertainty by
including a probabilistic description of the uncertain parameters in the model. Stochastic
programs are therefore more appropriate or valuable than deterministic programs in many
situations, and this is emphasized throughout the dissertation. The dissertation contains a
development of the theory of stochastic programming, and a number of illustrative
examples are formulated and solved. As a reallife application, a stochastic model for the
unit commitment problem facing Eskom (one of the world's largest producers of electricity)
is formulated and solved, and the solution is compared with that of the current strategy
employed by Eskom. / AC 2018

19 
Providing Support for the Movidius Myriad1 Platform in the SkePU Skeleton Programming FrameworkCuello, Rosandra January 2014 (has links)
The Movidius Myriad1 Platform is a multicore embedded platform primed to offer high performance and power efficiency for computer vision applications in mobile devices. The challenges of programming multicore environments are well known and skeleton programming offers a highlevel programming alternative for parallel computing, intended to hide the complexities of the system from the programmer. The SkePU Skeleton Programming Framework includes backend implementations for CPU and GPU systems and it has the capacity to support more platforms by extending its backend implementations. With this master thesis project we aim to extend the SkePU Skeleton Programming Framework to provide support for execution in the Movidius Myriad1 embedded platform. Our SkePU backend for Myriad1 consists on a set of macros and functions to compose the different elements of a Myriad1 application, data communication structures to exchange data between the host systems and Myriad1, and a helper script and auxiliary files to generate a Myriad1 application.Evaluation and testing demonstrate that our backend is usable, however further optimizations are needed to obtain good performance that would make it practical to use in real life applications, particularly when it comes to data communication. As part of this project, we have outlined some improvements that could be applied to obtain better performance overall in the future, addressing the issues found with the methods of data communication.

20 
A new twophase heuristic for twodimensional rectangular binpacking and strippacking / / A new 2phase heuristic for 2dimensional rectangular binpacking and strippacking.Sadones, Sylvie. January 1985 (has links)
No description available.

Page generated in 0.1193 seconds