• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4159
  • 1558
  • 597
  • 349
  • 332
  • 190
  • 77
  • 65
  • 64
  • 57
  • 57
  • 57
  • 57
  • 57
  • 56
  • Tagged with
  • 10283
  • 3494
  • 1707
  • 1316
  • 1282
  • 1203
  • 1169
  • 1070
  • 1020
  • 983
  • 927
  • 925
  • 800
  • 758
  • 633
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Internal convex programming, orthogonal linear programming, and program generation procedures.

Ristroph, John Heard, January 1975 (has links)
Thesis (Ph. D.)--Virginia Polytechnic Institute, 1975. / Also available via the Internet.

Surrogate dual search in nonlinear integer programming.

January 2009 (has links)
Wang, Chongyu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 74-78). / Abstract also in Chinese. / Abstract --- p.1 / Abstract in Chinese --- p.3 / Acknowledgement --- p.4 / Contents --- p.5 / List of Tables --- p.7 / List of Figures --- p.8 / Chapter 1. --- Introduction --- p.9 / Chapter 2. --- Conventional Dynamic Programming --- p.15 / Chapter 2.1. --- Principle of optimality and decomposition --- p.15 / Chapter 2.2. --- Backward dynamic programming --- p.17 / Chapter 2.3. --- Forward dynamic programming --- p.20 / Chapter 2.4. --- Curse of dimensionality --- p.23 / Chapter 3. --- Surrogate Constraint Formulation --- p.26 / Chapter 3.1. --- Surrogate constraint formulation --- p.26 / Chapter 3.2. --- Singly constrained dynamic programming --- p.28 / Chapter 3.3. --- Surrogate dual search --- p.29 / Chapter 4. --- Distance Confined Path Algorithm --- p.34 / Chapter 4.1. --- Yen´ةs algorithm for the kth shortest path problem --- p.35 / Chapter 4.2. --- Application of Yen´ةs method to integer programming --- p.36 / Chapter 4.3. --- Distance confined path problem --- p.42 / Chapter 4.4. --- Application of distance confined path formulation to integer programming --- p.50 / Chapter 5. --- Convergent Surrogate Dual Search --- p.59 / Chapter 5.1. --- Algorithm for convergent surrogate dual search --- p.62 / Chapter 5.2. --- "Solution schemes for (Pμ{αk,αβ)) and f(x) = αk" --- p.63 / Chapter 5.3. --- Computational Results and Analysis --- p.68 / Chapter 6. --- Conclusions --- p.72 / Bibliography --- p.74

General solution methods for mixed integer quadratic programming and derivative free mixed integer non-linear programming problems

Newby, Eric 29 July 2013 (has links)
A dissertation submitted to the Faculty of Science School of Computational and Applied Mathematics, University of the Witwatersrand, Johannesburg. April 27, 2013. / In a number of situations the derivative of the objective function of an optimization problem is not available. This thesis presents a novel algorithm for solving mixed integer programs when this is the case. The algorithm is the first developed for problems of this type which uses a trust region methodology. Three implementations of the algorithm are developed and deterministic proofs of convergence to local minima are provided for two of the implementations. In the development of the algorithm several other contributions are made. The derivative free algorithm requires the solution of several mixed integer quadratic programming subproblems and novel methods for solving nonconvex instances of these problems are developed in this thesis. Additionally, it is shown that the current definitions of local minima for mixed integer programs are deficient and a rigorous approach to developing possible definitions is proposed. Using this approach we propose a new definition which improves on those currently used in the literature. Other components of this thesis are an overview of derivative based mixed integer non-linear programming, extensive reviews of mixed integer quadratic programming and deterministic derivative free optimization and extensive computational results illustrating the effectiveness of the contributions mentioned in the previous paragraphs.

A new two-phase heuristic for two-dimensional rectangular bin-packing and strip-packing /

Sadones, Sylvie. January 1985 (has links)
No description available.

Data structures for a fragment based programming environment

Pinsonneault, Luc January 1987 (has links)
No description available.

Mathematical programming with cones

Massam, Hélène Ménèxia. January 1977 (has links)
No description available.

Convex programming without constraint qualification : a study of Pareto optimality

Fraklin, Martin Gordon. January 1975 (has links)
No description available.

Lifted cover inequalities for 0-1 and mixed 0-1 integer programs

Gu, Zonghao 08 1900 (has links)
No description available.

Designing an application-specific programming language for mobile robots

Biggs, Geoffrey January 2007 (has links)
The process of programming mobile robots is improved by this work. The tools used for programming robot systems have not advanced significantly, while robots themselves are rapidly becoming more capable because of advances in computing power and sensor technology. Industrial robotics relies on simple programming tools usable by non-expert programmers, while robotics researchers tend to use general purpose languages designed for programming in other domains. The task of developing a robot cannot be assumed to be identical to developing other software-based systems. The nature of robot programming is that there are different and additional challenges when programming a robot than when programming in other domains. A robot has many complex interfaces, must deal with regular and irregular events, real-time issues, large quantities of data, and the dangers of unknown conditions. Mobile robots move around and are capable of affecting everything in the environment. They are found in cluttered environments, rather than the carefully-controlled work spaces of industrial robots, increasing the risk to life and property and the complexity of the software. An analysis of the process of developing robots provides insight into how robot programming environments can be improved to make the task of robot development easier. Three analyses have been performed: a task analysis, to determine the important components of the robot development process, a use case analysis, to determine what robot developers must do, and a requirements analysis, to determine the requirements of a robot programming environment. From these analyses, the important features of a robot development environment were found. They include features such as data types for data commonly found in robotics, semantics for managing reactivity, and debugging facilities such as simulators. The analyses also found that the language is an important component of the programming environment. An application-specific language designed for robot programming is proposed as a solution for providing this component. Application-specific languages are designed for a particular domain of programming, allowing them to overcome the difficulties in that domain without concern for their usefulness in other domains. To test the hypothesis that such a language would improve robot development a set of language extensions has been created. These extensions, named RADAR, provide explicit support for robotics. The prototype implementation uses the Python programming language as the base language. RADAR provides support for two of the necessary features found in the analyses. The first is support for dimensioned data via a new primitive data type, ensuring all dimensioned data is consistent throughout a program. Dimensional analysis support is provided, allowing the safe mixing of data with compatible units, the creation of more complex units from simple single-dimension units, and built-in checking for errors in dimensioned data such as performing operations involving incompatible dimensioned data. For example, the data type will prevent the addition of distance and speed values. Several dimensional analysis systems have been developed for general purpose languages in the past. However, this is the first application of the concept specifically to robotics. The second feature is semantics for managing reactivity. In RADAR, the principle of ease-of-use through simplicity is followed. Special objects represent events and responses, and a special syntax is used for both specifying these objects and managing the connections between them in response to the changing state of the program. This reduces programming complexity and time. There are many other languages for managing reactivity, both the more general languages, such as Esterel, and languages for robotics, such as TDL and Colbert. RADAR is simpler than the general languages, as it is aimed solely at the needs of robot developers. However, it takes a different approach to its design than other languages for reactivity in robotics. These are designed to provide support for a specific architecture or architecture style; RADAR is designed based on the needs of robot developers and so is architecture-independent. RADAR’s design philosophy is to provide robot-specific features with simple semantics. RADAR is designed to support what robot developers need to do with the language, rather than providing a special syntax for supporting a particular robot, architecture or other system. RADAR has been shown to provide an improvement in dimensioned data management and reactivity management for mobile robot programming. It increases the readability, writability and reliability of robot software, and can reduce programming and maintenance costs. RADAR shows that an application-specific approach to developing a robot programming language can improve the process of robot development.

Limitations of and extensions to heuristic search planning

Burfoot, Daniel. January 2006 (has links)
This thesis explores limitations of heuristic search planning, and presents techniques to overcome those limitations. The two halves of the thesis discuss problems in standard propositional planning (STRIPS) and in planning with numeric state variables respectively. / In the context of STRIPS, the primary focus is on the widely used relaxed plan heuristic (h+). A variety of cases are shown in which h+ provides systematically bad estimates of goal distance. To address this breakdown, a planning system called RRT-Plan is presented. This system is inspired by the concept of Rapidly-exploring Random Trees, which was originally developed for use in mobile robot path planning. Experimental results show that RRT-Plan is comparable to leading planners in terms of number of problems solved and plan quality. We conclude that the effectiveness of RRT-Plan is based on its ability to search the space of artificial goal orderings. / The second half of the work considers heuristic search planning in numeric domains. Two particularly significant obstacles are identified. The Curse of Affluence is due to the vast blowup in the search space caused by the addition of numeric variables. The Curse of Poverty relates to the difficulty of finding relevant lower bounds on resource consumption. / Exploration of the Curse of Affluence leads to the new concepts of reduced search and enhanced states. In reduced search, certain simple operators are not used to expand states. Instead, enhanced states are constructed which represent all possible states which could be achieved by suitably inserting simple operators in the plan. Enhanced states are represented by a set of constant discrete variables, and a convex hull of numeric values. This representation can be queried and updated in a natural way. Experimental results show that there are domains for which reduced search gives order of magnitude performance improvements over Metric-FF, a leading heuristic search planner for numeric domains.

Page generated in 0.1322 seconds