531 |
Learning by example for parametric font designLau, Man-kin., 劉文建. January 2009 (has links)
published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy
|
532 |
Forecasting with smoothing techniques for inventory control何添賢, Ho, Tim Yin, Timothy. January 1994 (has links)
published_or_final_version / Statistics / Master / Master of Philosophy
|
533 |
Development of a bioinformatics and statistical framework to integratebiological resources for genome-wide genetic mapping and itsapplicationsLi, Miaoxin., 李淼新. January 2009 (has links)
published_or_final_version / Biochemistry / Doctoral / Doctor of Philosophy
|
534 |
Statistical methods and analyses in human gene mappingKwan, Sheung-him., 關尚謙. January 2009 (has links)
published_or_final_version / Psychiatry / Doctoral / Doctor of Philosophy
|
535 |
On Model Reduction of Distributed Parameter ModelsLiu, Yi January 2002 (has links)
No description available.
|
536 |
High accuracy correlated wavefunctionsHarrison, R. J. January 1984 (has links)
No description available.
|
537 |
A unified systems development paradigm which synthesises Object-Oriented Methodologies and VDMCharatan, Quentin January 1996 (has links)
No description available.
|
538 |
Inexact subgradient methods.Au, Kelly Thurston. January 1992 (has links)
In solving a mathematical program, the exact evaluation of the objective function and its subgradients can be computationally burdensome. For example, in a stochastic program, the objective function is typically defined through a multi-dimensional integration. Solution procedures for stochastic programs are usually based on functional approximation techniques, or statistical applications of subgradient methods. In this dissertation, we explore algorithms by combining functional approximation techniques with subgradient optimization methods. This class of algorithms is referred to as "inexact subgradient methods". First, we develop a basic inexact subgradient method and identify conditions under which this approach will lead to an optimal solution. We also offer an inexact subgradient algorithm by adaptively defining the steplengths via estimated bounds on the deviations from optimality. Second, we explore approaches in which functional approximation techniques can be combined with a primal-dual subgradient method. In these algorithms, the steplengths are defined via the primal and dual information. Hence suggestions to optimality can be reflected through the steplengths, as the iteration proceeds. We also incorporate space dilation operations, which stabilize the moving directions, within our basic inexact subgradient method. As an example of the applicability of these methods, we use statistically defined approximations, which are similar to those derived in Stochastic Decomposition, in some of our algorithms for the solutions of stochastic programs.
|
539 |
Modelling physics problem solvingScanlon, Eileen January 1989 (has links)
No description available.
|
540 |
Mobius inversion of some classical groups and their application to the enumeration of regular hypermapsDowns, M. L. N. January 1988 (has links)
No description available.
|
Page generated in 0.0428 seconds