- 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.
Search results
Showing 41 to 50 of 10644 (0.02 seconds)| 41 |
Convex programming without constraint qualification : a study of Pareto optimalityFraklin, Martin Gordon. January 1975 (has links)
No description available.
|
| 42 |
Nonconvex programming with applications to production and location problemsVaish, Harish 12 1900 (has links)
No description available.
|
| 43 |
Analysis and optimization of complex nonserial dynamic programming network systemsLee, Chae Young 05 1900 (has links)
No description available.
|
| 44 |
Group theoretic structures in the fixed charge transportation problemTompkins, Curtis Johnston 08 1900 (has links)
No description available.
|
| 45 |
Variable selection rules for implicit enumerationCarroll, Charles Lemuel 05 1900 (has links)
No description available.
|
| 46 |
A comparative study and analysis of a class of dynamic programming algorithmsAhn, Chul Woo 05 1900 (has links)
No description available.
|
| 47 |
Lifted cover inequalities for 0-1 and mixed 0-1 integer programsGu, Zonghao 08 1900 (has links)
No description available.
|
| 48 |
Solving discrete minimax problems with constraintsTurner, Bella Tobie January 1976 (has links)
No description available.
|
| 49 |
A distributed graph reducer for lazy functional languages /Howson, Christopher January 1992 (has links)
This thesis describes a model for distributed graph reduction implemented on a network of transputers. The model allows variable size communications between processors, by exchanging subgraphs instead of single nodes. Functional languages with lazy semantics have graph nodes representing unevaluated arguments. These nodes require special treatment by the run time system because they must not be copied. By checking the structure of the transmitted subgraphs, it is possible to determine which unevaluated expressions have no external references to them and so may safely be included in the subgraph with no overhead. This allows large subgraphs to be exchanged while reducing the demands on the communications system. This technique raises the possibility of implementations on a wide variety of distributed computers such as networks of workstations, which hitherto has been considered impractical.
|
| 50 |
Hybrid control of multiple autonomous mobile robotsAxelsson, Henrik 05 1900 (has links)
No description available.
|
Page generated in 0.0238 seconds