- 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 151 to 160 of 10691 (0.039 seconds)Spelling suggestions: "subject:"cynamic A*"" "subject:"clynamic A*""
| 151 |
Intelligent power module for variable speed AC motor drivesAllaith, Noori A. January 1997 (has links)
No description available.
|
| 152 |
Separated continuous linear programs : theory and algorithmsPullan, Malcolm Craig January 1992 (has links)
No description available.
|
| 153 |
Combinatorial Bin Packing ProblemsNielsen, Torben Noerup January 1985 (has links)
In the past few years, there has been a strong and growing interest in evaluating the expected behavior of what we call combinatorial bin packing problems. A combinatorial bin packing problem consists of a number of items of various sizes and value ratios (value per unit of size) along with a collection of bins of fixed capacity into which the items are to be packed. The packing must be done in such a way that the sum of the sizes of the items into a given bin does not exceed the capacity of that bin. Moreover, an item must either be packed into a bin in its entirety or not at all: this "all or nothing" requirement is why these problems are characterized as being combinatorial. The objective of the packing is to optimize a given criterion Junction. Here optimize means either maximize or minimize, depending on the problem. We study two problems that fit into this framework: the Knapsack Problem and the Minimum Sum of Squares Problem. Both of these problems are known to be in the class of NP-hard problems and there is ample reason to suspect that these problems do not admit of efficient exact solution. We obtain results concerning the performance of heuristics under the assumption that the inputs are random samples from some distribution. For the Knapsack Problem, we develop four heuristics, two of which are on-line and two off-line. All four heuristics are shown to be asymptotically optimal in expectation when the item sizes and value ratios are assumed to be independent and uniform. One heuristic is shown to be asymptotically optimal in expectation when the item sizes are uniformly distributed and the value ratios are exponentially distributed. The amount of time required by these heuristics is no more than proportional to the amount of time required to sort the items in order of nonincreasing value ratios. For the Minimum Sum of Squares Problem, we develop two heuristics, both of which are off-line. Both of these heuristics are shown to be asymptotically optimal in expectation when the sizes of the items input are assumed uniformly distributed.
|
| 154 |
Superscalar architectures and statically scheduled programsTate, Daniel January 2000 (has links)
No description available.
|
| 155 |
Fluid loading and hydro-elastic response of towed pipelinesChang, Yŏng-sik January 1996 (has links)
No description available.
|
| 156 |
Interaction patterns, learning processes and equilibria in population gamesIanni, Antonella January 1996 (has links)
No description available.
|
| 157 |
Statistical energy analysis of marine structures with periodic and near-periodic componentsSmith, Jeremy Richard Denham January 1999 (has links)
No description available.
|
| 158 |
Variation of Fenchel Nielsen coordinatesSkelton, George January 2001 (has links)
No description available.
|
| 159 |
Nonlinear response analysis of guyed mastsKarbassi, A. A. January 1987 (has links)
No description available.
|
| 160 |
The performance of corrugated carbon fibre pressure vessels under external pressureLittle, Andrew P. F. January 2000 (has links)
No description available.
|
Page generated in 0.0467 seconds