NotesFAQContact Us
Collection
Advanced
Search Tips
Laws, Policies, & Programs
What Works Clearinghouse Rating
Showing 136 to 150 of 220 results Save | Export
Peer reviewed Peer reviewed
De Soete, Geert; Winsberg, Suzanne – Psychometrika, 1993
A probabilistic choice model, based on L. L. Thurstone's Law of Comparative Judgment Case V, is developed for paired comparisons data about psychological stimuli. The model assumes that each stimulus is measured on a small number of physical variables. An algorithm for estimating parameters is illustrated with real data. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Estimation (Mathematics), Graphs
Peer reviewed Peer reviewed
Armstrong, Ronald D.; Jones, Douglas H. – Applied Psychological Measurement, 1992
Polynomial algorithms are presented that are used to solve selected problems in test theory, and computational results from sample problems with several hundred decision variables are provided that demonstrate the benefits of these algorithms. The algorithms are based on optimization theory in networks (graphs). (SLD)
Descriptors: Algorithms, Decision Making, Equations (Mathematics), Mathematical Models
Peer reviewed Peer reviewed
Swanson, Len; Stocking, Martha L. – Applied Psychological Measurement, 1993
A model for solving very large item selection problems is presented. The model builds on binary programming applied to test construction. A heuristic for selecting items that satisfy the constraints in the model is also presented, and various problems are solved using the model and heuristic. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Heuristics, Item Response Theory
Richards, William D., Jr. – 1976
The first part of this four-part dissertation reviews conceptual and operational approaches to human communication systems. A new conceptual model for studying communication, General Algorithm for Studying Structuring in Complex Systems (GASSICS), is developed in the second part, and an operational method for applying GASSICS is presented in part…
Descriptors: Algorithms, Communication (Thought Transfer), Doctoral Dissertations, Group Dynamics
Tracz, G. S.; Burtnyk, W. A. – 1972
To fully develop a teacher cost model, it is essential to be able to forecast the number of teachers that leave the experience category distribution -- not only the total number that leave, but also the number that leave from each category and experience level within the distribution. Similarly, it is essential to be able to forecast, to the same…
Descriptors: Algorithms, Costs, Mathematical Models, Prediction
Peer reviewed Peer reviewed
Jencks, Stanley M.; Peck, Donald M. – Arithmetic Teacher, 1972
Descriptors: Algorithms, Elementary School Mathematics, Fractions, Instruction
Peer reviewed Peer reviewed
Shapiro, Jonathan – American Educational Research Journal, 1979
Contrary to Anderson (EJ 187 936), his rule for equation identification is a necessary but not sufficient condition; furthermore, the choice of two-stage or ordinary least squares depends on results and not on methodological properties of estimators. Modification of Anderson's rule and a means for choosing between estimates is offered. (Author/CP)
Descriptors: Algorithms, Educational Research, Least Squares Statistics, Mathematical Models
Peer reviewed Peer reviewed
Hunt, William J. – Mathematics Teacher, 1995
Shows how to model Newton's method for approximating roots on a spreadsheet. (MKR)
Descriptors: Algorithms, Computation, Computer Uses in Education, Mathematical Concepts
Peer reviewed Peer reviewed
Song, Xueshu – International Journal of Instructional Media, 1992
Describes the development of a computer-aided decision-making system to assist educational practitioners in curriculum decision making about innovative program features and implementation requirements. Topics discussed include the identification of variables; database generation; mathematical modeling; compromising between effectiveness and…
Descriptors: Algorithms, Computer Software Development, Curriculum Development, Databases
Peer reviewed Peer reviewed
Wilson, Mark; Adams, Raymond J. – Journal of Educational Statistics, 1993
A marginal maximum likelihood estimation algorithm is presented for the ordered partition model of M. Wilson that does not require the set of available responses to be fully ordered. The model and its estimation algorithm are illustrated in a comparison of alternative scoring schemes for open-ended science items. (SLD)
Descriptors: Algorithms, Comparative Analysis, Elementary Secondary Education, Equations (Mathematics)
Tatsuoka, Kikumi K. – 1991
Diagnosing cognitive errors possessed by examinees can be considered as a pattern classification problem that is designed to classify a sequential input of stimuli into one of several predetermined groups. The sequential inputs in this paper's context are item responses, and the predetermined groups are various states of knowledge resulting from…
Descriptors: Algorithms, Classification, Cognitive Processes, Equations (Mathematics)
Butler, Ronald W. – 1985
The dynamic linear model or Kalman filtering model provides a useful methodology for predicting the past, present, and future states of a dynamic system, such as an object in motion or an economic or social indicator that is changing systematically with time. Recursive likelihood methods for adaptive Kalman filtering and smoothing are developed.…
Descriptors: Algorithms, Estimation (Mathematics), Mathematical Models, Maximum Likelihood Statistics
Urry, Vern W. – 1983
In this report, selection theory is used as a theoretical framework from which mathematical algorithms for tailored testing are derived. The process of tailored, or adaptive, testing is presented as analogous to personnel selection and rejection on a series of continuous variables that are related to ability. Proceeding from a single common-factor…
Descriptors: Adaptive Testing, Algorithms, Computer Assisted Testing, Latent Trait Theory
van der Linden, Wim J.; Boekkooi-Timminga, Ellen – 1987
A "maximin" model for item response theory based test design is proposed. In this model only the relative shape of the target test information function is specified. It serves as a constraint subject to which a linear programming algorithm maximizes the information in the test. In the practice of test construction there may be several…
Descriptors: Algorithms, Foreign Countries, Item Banks, Latent Trait Theory
Knol, Dirk L. – 1989
Two iterative procedures for constructing Rasch scales are presented. A log-likelihood ratio test based on a quasi-loglinear formulation of the Rasch model is given by which one item at a time can be deleted from or added to an initial item set. In the so-called "top-down" algorithm, items are stepwise deleted from a relatively large…
Descriptors: Algorithms, Item Banks, Latent Trait Theory, Mathematical Models
Pages: 1  |  ...  |  5  |  6  |  7  |  8  |  9  |  10  |  11  |  12  |  13  |  14  |  15