Publication Date
In 2025 | 77 |
Since 2024 | 391 |
Since 2021 (last 5 years) | 767 |
Since 2016 (last 10 years) | 793 |
Since 2006 (last 20 years) | 796 |
Descriptor
Source
Author
van der Linden, Wim J. | 17 |
Kiers, Henk A. L. | 13 |
ten Berge, Jos M. F. | 10 |
Gongjun Xu | 9 |
Gerlach, Vernon S. | 8 |
Willett, Peter | 8 |
Chun Wang | 7 |
Stocking, Martha L. | 7 |
Charp, Sylvia | 6 |
Chen, Hsinchun | 6 |
Craven, Timothy C. | 6 |
More ▼ |
Publication Type
Education Level
Audience
Practitioners | 255 |
Teachers | 126 |
Researchers | 114 |
Policymakers | 6 |
Administrators | 5 |
Students | 4 |
Counselors | 1 |
Media Staff | 1 |
Support Staff | 1 |
Location
China | 17 |
Australia | 16 |
Netherlands | 14 |
Turkey | 13 |
USSR | 10 |
United States | 9 |
California | 8 |
United Kingdom (England) | 7 |
Brazil | 6 |
Europe | 6 |
Germany | 6 |
More ▼ |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Stocking, Martha L.; Lewis, Charles – 1995
The interest in the application of large-scale adaptive testing for secure tests has served to focus attention on issues that arise when theoretical advances are made operational. Many such issues in the application of large-scale adaptive testing for secure tests have more to do with changes in testing conditions than with testing paradigms. One…
Descriptors: Ability, Adaptive Testing, Algorithms, Computer Assisted Testing

And Others; Sgall, Petr – Information Processing and Management, 1975
Looks for a method to formulate algorithms useful for the synthesis of Czech in machine translation where the point of departure for the synthesis can be more or less identical with the semantic representation. (Author/PF)
Descriptors: Algorithms, Computational Linguistics, Czech, Graphemes

Tritchler, D. L.; Pedrini, D. T. – Educational and Psychological Measurement, 1975
Considered in this paper are a mathematical discussion and an algorithm, and a computer program for Fisher's test. (Author)
Descriptors: Algorithms, Computer Programs, Hypothesis Testing, Input Output

McClelland, Gary; Coombs, Clyde H. – Psychometrika, 1975
ORDMET is applicable to structures obtained from additive conjoint measurement designs, unfolding theory, general Fechnerian scaling, types of multidimensional scaling, and ordinal multiple regression. A description is obtained of the space containing all possible numerical representations which can satisfy the structure, size, and shape of which…
Descriptors: Algorithms, Computer Programs, Data Analysis, Matrices
Ireland, David – Orbit 27, 1975
This article examines whether or not we are preparing our children to cope with change by teaching them to think. (PB)
Descriptors: Algorithms, Knowledge Level, Problem Solving, Productive Thinking

Wolff, J. G. – British Journal of Psychology, 1975
The main purpose of this paper is to describe and discuss the mechanism and properties of a computer program which can achieve an analogous segmentation of letter strings on punched cards. (Author)
Descriptors: Algorithms, Computer Programs, Phonemes, Program Descriptions

Ikeda, Hitoshi; Ando, Masue – Arithmetic Teacher, 1974
Descriptors: Algorithms, Elementary School Mathematics, Instruction, Manipulative Materials
Flournoy, Nancy – 1989
Designs for sequential sampling procedures that adapt to cumulative information are discussed. A familiar illustration is the play-the-winner rule in which there are two treatments; after a random start, the same treatment is continued as long as each successive subject registers a success. When a failure occurs, the other treatment is used until…
Descriptors: Algorithms, Evaluation Methods, Mathematical Models, Research Design
Lederman, Barbara J. – Journal of Computer-Based Instruction, 1975
Useful programming tricks are suggested to allow the reduction of many equations and non-polynomial-like expressions and the subsequent application of the mathematical algorithms. (Author)
Descriptors: Algebra, Algorithms, Computer Programs, Computer Science

Spence, Ian; Domoney, Dennis W. – Psychometrika, 1974
Monte Carlo procedures were used to investigate the properties of a nonmetric multidimensional scaling algorithm when used to scale an incomplete matrix of dissimilarities. Recommendations for users wishing to scale incomplete matrices are made. (Author/RC)
Descriptors: Algorithms, Comparative Analysis, Correlation, Matrices

Cacha, Frances B. – Arithmetic Teacher, 1975
A modified method of regrouping the minuend for subtraction is described. This more flexible method decreases the number of steps in the subtraction process and in checking the regrouping. (SD)
Descriptors: Algorithms, Elementary Education, Elementary School Mathematics, Instruction
O'Neill, Edward T.; Aluri, Rao – 1980
The error-correcting algorithm described was constructed to examine subject headings in online catalog records for common errors such as omission, addition, substitution, and transposition errors, and to make needed changes. Essentially, the algorithm searches the authority file for a record whose primary key exactly matches the test key. If an…
Descriptors: Algorithms, Cataloging, Databases, Information Retrieval
Schmid, Richard F.; Gerlach, Vernon S. – 1977
This paper discusses several instructional issues, defines the benefits of algorithmic prescriptions, and examines their effectiveness and efficiency. An experimental study asked 77 undergraduates to master and utilize one of three forms of an algorithm: a prose discourse, a flowchart procedure, or a mastery-inducing flowchart technique. Also…
Descriptors: Algorithms, Educational Research, Higher Education, Instructional Development

Rothstein, Jerome – 1977
Addressing the problem of protecting confidential information and data stored in computer databases from access by unauthorized parties, this paper details coding schemes which present such astronomical work factors to potential code breakers that security breaches are hopeless in any practical sense. Two procedures which can be used to encode for…
Descriptors: Algorithms, Codification, Computer Programs, Confidentiality
Bailey, Charles-James N. – Working Papers in Linguistics, 1970
This study of linguistic change is done within the "dynamic paradigm" of linguistic description, in which the strict dichotomy between diachronic and synchronic linguistics found in "static paradigms" is not maintained. The chief purpose here is to indicate how rate could be built into a linguistic description of sound change, such change being…
Descriptors: Algorithms, Diachronic Linguistics, Distinctive Features (Language), Linguistic Theory