Publication Date
In 2025 | 81 |
Since 2024 | 396 |
Since 2021 (last 5 years) | 772 |
Since 2016 (last 10 years) | 798 |
Since 2006 (last 20 years) | 801 |
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
Australia | 17 |
China | 17 |
Netherlands | 14 |
Turkey | 13 |
USSR | 10 |
United States | 10 |
California | 8 |
United Kingdom (England) | 7 |
Brazil | 6 |
Europe | 6 |
Germany | 6 |
More ▼ |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Donoghue, John R. – 1995
A Monte Carlo study compared the usefulness of six variable weighting methods for cluster analysis. Data were 100 bivariate observations from 2 subgroups, generated according to a finite normal mixture model. Subgroup size, within-group correlation, within-group variance, and distance between subgroup centroids were manipulated. Of the clustering…
Descriptors: Algorithms, Cluster Analysis, Comparative Analysis, Correlation
Bierschenk, Bernhard – 1995
A method for the assessment of competence in language is suggested that allows a new approach to the study of the sources and conditions of competence development. The method builds on the functional analysis of text building behavior, making use of the discontinuities in produced text as the only reliable observations from a scientific point of…
Descriptors: Algorithms, Competence, Educational Assessment, Language Proficiency
Woodruff, David J.; Hanson, Bradley A. – 1996
This paper presents a detailed description of maximum parameter estimation for item response models using the general EM algorithm. In this paper the models are specified using a univariate discrete latent ability variable. When the latent ability variable is discrete the distribution of the observed item responses is a finite mixture, and the EM…
Descriptors: Ability, Algorithms, Estimation (Mathematics), Item Response Theory
Frazier, Michael Duane – 1994
Computer task automation is part of the natural progression of encoding information. This thesis considers the automation process to be a question of whether it is possible to automatically learn the encoding based on the behavior of the system to be described. A variety of representation languages are considered, as are means for the learner to…
Descriptors: Algorithms, Automation, Coding, Computation
Kurz, Terri Barber – 1999
Multiple-choice tests are generally scored using a conventional number right scoring method. While this method is easy to use, it has several weaknesses. These weaknesses include decreased validity due to guessing and failure to credit partial knowledge. In an attempt to address these weaknesses, psychometricians have developed various scoring…
Descriptors: Algorithms, Guessing (Tests), Item Response Theory, Multiple Choice Tests

Steen, Lynn Arthur – Science, 1975
Reports on two types of unsolvability in mathematics. One is an instance of impossibility and the second is a judgment of undecidability. Presents a number of examples of undecidable propositions. (GS)
Descriptors: Algorithms, Mathematical Concepts, Mathematical Logic, Mathematics Education

Holden, Lyman – School Science and Mathematics, 1974
Descriptors: Algorithms, Curriculum, Elementary School Mathematics, Instruction
Gibbons, Robert D.; And Others – 1990
The probability integral of the multivariate normal distribution (ND) has received considerable attention since W. F. Sheppard's (1900) and K. Pearson's (1901) seminal work on the bivariate ND. This paper evaluates the formula that represents the "n x n" correlation matrix of the "chi(sub i)" and the standardized multivariate…
Descriptors: Algorithms, Equations (Mathematics), Estimation (Mathematics), Generalizability Theory
Larson, Jay – 1986
Success in using a computer in education as a problem-solving tool requires a change in the way of thinking or of approaching a problem. An algorithm, i.e., a finite step-by-step solution to a problem, can be designed around the data processing concepts of input, processing, and output to provide a basis for classifying problems. If educators…
Descriptors: Algorithms, Computers, Data Processing, Educational Change

Cromer, Fred Eugene – Journal for Research in Mathematics Education, 1974
Difficulty levels of 168 randomly generated multiplication problems were obtained by testing 238 fifth-graders. Variables concerning the number of operations, digits carried, and magnitude of the digits were defined, and a least-squares procedure was used to construct structural models accounting for 60-70 per cent of observed problem difficulty…
Descriptors: Algorithms, Difficulty Level, Elementary School Mathematics, Learning Problems
Charp, Sylvia; And Others – 1966
This text contains material designed for about 18 weeks of study at grades 11 or 12. Use of a computer with the course is highly recommended. Developing an understanding of the relationship between mathematics, computers, and problem solving is the main objective of this book. The following chapters are included in the book: (1) Algorithms,…
Descriptors: Algorithms, Computers, Instructional Materials, Programing Languages
Charp, Sylvia; And Others – 1966
This is the student's textbook for Algorithms, Computation, and Mathematics (Algol Supplement). This computer language supplement is split off from the main text to enable a school to choose the computer language desired, and also to make it easier to modify the course as languages change. The chapters in the text are designed to add language…
Descriptors: Algorithms, Computers, Instructional Materials, Programing Languages
Charp, Sylvia; And Others – 1966
This is the student's textbook for Algorithms, Computation, and Mathematics (Fortran Supplement). This computer language supplement is split off from the main text to enable a school to choose the computer language desired, and also to make it easier to modify the course as languages change. The chapters in the text are designed to add language…
Descriptors: Algorithms, Computers, Instructional Materials, Programing Languages

Michiels, A. – ITL Review of Applied Linguistics, 1975
Binary algorithmic logic may prove useful for teaching grammar, especially in the case of 'closed-system items.' (Text is in French.) Available from Instituut voor Toegepaste Linguistiek, Vesaliusstraat 2, B. 3000 Leuven, Belgium. (TL)
Descriptors: Algorithms, Form Classes (Languages), Grammar, Language Instruction
Brown, Stephen I. – Mathematics Teaching, 1974
The author advocates the classroom consideration of new algorithms as a means of leading students to make original hypotheses. He discusses a multiplication algorithm based on the differences between squares. (SD)
Descriptors: Algorithms, Curriculum, Elementary Education, Elementary School Mathematics