• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 40
  • 11
  • 4
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 75
  • 75
  • 47
  • 23
  • 19
  • 15
  • 14
  • 12
  • 12
  • 11
  • 10
  • 7
  • 7
  • 7
  • 7
  • 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.
1

Learning successful strategies in repeated general-sum games /

Crandall, Jacob W., January 2005 (has links) (PDF)
Thesis (Ph.D.)--Brigham Young University. Dept. of Computer Science, 2005. / Includes bibliographical references (p. 163-168).
2

Algorithmic stability and ensemble-based learning /

Kutin, Samuel. January 2002 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Computer Science, June 2002. / Includes bibliographical references. Also available on the Internet.
3

Solution path algorithms : an efficient model selection approach /

Wang, Gang. January 2007 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 102-108). Also available in electronic version.
4

Dynamic planning and scheduling in manufacturing systems with machine learning approaches

Yang, Donghai. January 2008 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2009. / Includes bibliographical references. Also available in print.
5

Dynamic planning and scheduling in manufacturing systems with machine learning approaches /

Yang, Donghai. January 2008 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2009. / Includes bibliographical references. Also available online.
6

Meta-learning strategies, implementations, and evaluations for algorithm selection /

Köpf, Christian Rudolf. January 1900 (has links)
Thesis (doctorate)--Universität Ulm, 2005. / Includes bibliographical references (p. 227-248).
7

A local model network approach to nonlinear modelling

Murray-Smith, Roderick January 1994 (has links)
This thesis describes practical learning systems able to model unknown nonlinear dynamic processes from their observed input-output behaviour. Local Model Networks use a number of simple, locally accurate models to represent a globally complex process, and provide a powerful, flexible framework for the integration of different model structures and learning algorithms. A major difficulty with Local Model Nets is the optimisation of the model structure. A novel Multi-Resolution Constructive (MRC) structure identification algorithm for local model networks is developed. The algorithm gradually adds to the model structure by searching for 'complexity' at ever decreasing scales of 'locality'. Reliable error estimates are useful during development and use of models. New methods are described which use the local basis function structure to provide interpolated state-dependent estimates of model accuracy. Active learning methods which automatically construct a training set for a given Local Model structure are developed, letting the training set grow in step with the model structure - the learning system 'explores' its data set looking for useful information. Local Learning methods developed in this work are explicitly linked to the local nature of the basis functions and provide a more computationally efficient method, more interpretable models and, due to the poor conditioning of the parameter estimation problem, often lead to an improvement in generalisation, compared to global optimisation methods. Important side-effects of normalisation of the basis functions are examined. A new hierarchical extension of Local Model Nets is presented: the Learning Hierarchy of Models (LHM), where local models can be sub-networks, leading to a tree-like hierarchy of softly interpolated local models. Constructive model structure identification algorithms are described, and the advantages of hierarchical 'divide-and-conquer' methods for modelling, especially in high dimensional spaces are discussed. The structures and algorithms are illustrated using several synthetic examples of nonlinear multivariable systems (dynamic and static), and applied to real world examples. Two nonlinear dynamic applications are described: predicting the strip thickness in an aluminium rolling mill from observed process data, and modelling robot actuator nonlinearities from measured data. The Local Model Nets reliably constructed models which provided the best results to date on the Rolling Mill application.
8

Connectionist feedforward networks for control of nonlinear systems

Hofer, Daniel G. Sbarbaro January 1992 (has links)
No description available.
9

Hierarchical multiple classifier learning system /

Chou, Yu-Yu. January 1999 (has links)
Thesis (Ph. D.)--University of Washington, 1999. / Vita. Includes bibliographical references (leaves 92-98).
10

Limitations and extensions of the WoLF-PHC algorithm /

Cook, Philip R., January 2007 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Computer Science, 2007. / Includes bibliographical references (p. 93-101).

Page generated in 0.2309 seconds