• 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.

A duality approach for solving problems of optimum allocation of resources / by John Bednarz

Bednarz, John January 1980 (has links)
Typescript (photocopy) / iv, 136 leaves ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--Dept. of Applied Mathematics, University of Adelaide, 1980

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.

An integer programming model for Navy's Maritime Patrol Aviation fleet

Drash, Robert W. January 1990 (has links) (PDF)
Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 1990. / Thesis Advisor(s): Wood, R. Kevin. Second Reader: Rosenthal, Richard E. "September 1990." Description based on title screen as viewed on December 17, 2009. Author(s) subject terms: Optimization, P-3, modernization, integer programming. Includes bibliographical references (p. 69). Also available in print.

Scheduling Marine Corps entry-level MOS schools /

Detar, Paul J. January 2004 (has links) (PDF)
Thesis (M.S. in Operations Research)--Naval Postgraduate School, Sept. 2004. / Thesis advisor(s): Robert F. Dell. Includes bibliographical references (p. 51-52). Also available online.

Linear restoration of bilinear systems

Goeke, Wayne C. January 1979 (has links)
Thesis (M.S.)--University of Wisconsin--Madison. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 147-149).

Dynamic channel allocation /

Kaminsky, Andrew D. January 2003 (has links) (PDF)
Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2003. / Thesis advisor(s): John Gibson, Geoffrey Xie. Includes bibliographical references (p. 191-193). Also available online.

Efficient presolving in linear programming

Sadhana, Vishnu V. January 2002 (has links)
Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Document formatted into pages; contains ix, 71 p. Includes vita. Includes bibliographical references.

Stability, approximation and decomposition in two- and multistage stochastic programming

Kuchler, Christian. January 2009 (has links)
Dissertation--Humboldt-Universität zu Berlin, 2009. / Includes bibliographical references and index.

A family of linear programming algorithms based on the von Neumann algorithm /

Gonçalves, João P. M. January 2005 (has links)
Thesis (Ph. D.)--Lehigh University, 2005. / Includes vita. Includes bibliographical references (leaves 112-117).

The complexity of the simplex algorithm

Currie, James D. January 1900 (has links)
Thesis (masters)--Carleton University, 1984. / Bibliography: p. 64.

Page generated in 0.1122 seconds