Self-adaptive modelling algorithms

D. G. Green; R. E. Reichelt; R. G. Buck

doi:10.1016/0378-4754(88)90101-2

Self-adaptive modelling algorithms

D. G. Green, R. E. Reichelt, R. G. Buck

Research output: Contribution to journal › Article › Research › peer-review

Abstract

"Self-adaptive" algorithms include a wide variety of procedures that derive models by "training" with data about the process concerned. Adaptive algorithms typically perform brilliantly under some conditions, but fail badly under others. Flexibility, reliability and speed are prime concerns in designing and using such algorithms.

Original language	English
Pages (from-to)	33-38
Number of pages	6
Journal	Mathematics and Computers in Simulation
Volume	30
Issue number	1-2
DOIs	https://doi.org/10.1016/0378-4754(88)90101-2
Publication status	Published - Feb 1988
Externally published	Yes

Access to Document

10.1016/0378-4754(88)90101-2

Link to publication in Scopus

Cite this

@article{91289dd2830544018beab291fb017478,

title = "Self-adaptive modelling algorithms",

abstract = "{"}Self-adaptive{"} algorithms include a wide variety of procedures that derive models by {"}training{"} with data about the process concerned. Adaptive algorithms typically perform brilliantly under some conditions, but fail badly under others. Flexibility, reliability and speed are prime concerns in designing and using such algorithms.",

author = "Green, {D. G.} and Reichelt, {R. E.} and Buck, {R. G.}",

year = "1988",

month = feb,

doi = "10.1016/0378-4754(88)90101-2",

language = "English",

volume = "30",

pages = "33--38",

journal = "Mathematics and Computers in Simulation",

issn = "0378-4754",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

T1 - Self-adaptive modelling algorithms

AU - Green, D. G.

AU - Reichelt, R. E.

AU - Buck, R. G.

PY - 1988/2

Y1 - 1988/2

N2 - "Self-adaptive" algorithms include a wide variety of procedures that derive models by "training" with data about the process concerned. Adaptive algorithms typically perform brilliantly under some conditions, but fail badly under others. Flexibility, reliability and speed are prime concerns in designing and using such algorithms.

AB - "Self-adaptive" algorithms include a wide variety of procedures that derive models by "training" with data about the process concerned. Adaptive algorithms typically perform brilliantly under some conditions, but fail badly under others. Flexibility, reliability and speed are prime concerns in designing and using such algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0023569077&partnerID=8YFLogxK

U2 - 10.1016/0378-4754(88)90101-2

DO - 10.1016/0378-4754(88)90101-2

M3 - Article

AN - SCOPUS:0023569077

VL - 30

SP - 33

EP - 38

JO - Mathematics and Computers in Simulation

JF - Mathematics and Computers in Simulation

SN - 0378-4754

IS - 1-2

ER -