Publication Date
| In 2026 | 0 |
| Since 2025 | 185 |
| Since 2022 (last 5 years) | 865 |
| Since 2017 (last 10 years) | 912 |
| Since 2007 (last 20 years) | 918 |
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 | 256 |
| Teachers | 128 |
| Researchers | 116 |
| Policymakers | 7 |
| Administrators | 5 |
| Students | 5 |
| Counselors | 1 |
| Media Staff | 1 |
| Support Staff | 1 |
Location
| China | 23 |
| Australia | 19 |
| Turkey | 16 |
| Netherlands | 14 |
| United States | 11 |
| USSR | 10 |
| California | 8 |
| Canada | 8 |
| Europe | 8 |
| Germany | 7 |
| South Korea | 7 |
| More ▼ | |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedAndrich, David – Applied Psychological Measurement, 1988
A simple probabilistic model for unfolding data collected by a direct response design in which responses were scored dichotomously was applied to the measurement of attitudes toward capital punishment. Responses conformed to the unfolding mechanism. Scale values of the statements were statistically equivalent to those of Thurstone's methods. (SLD)
Descriptors: Algorithms, Attitude Measures, Capital Punishment, Computer Simulation
Peer reviewedCrouch, Carolyn J. – Information Processing and Management, 1988
Describes the two basic approaches to the calculation of term discrimination values for automatic indexing. The results of an experiment that investigated the differences between algorithms of these two approaches in terms of their impact on the discrimination value model are reported and discussed. (13 references) (Author/CLB)
Descriptors: Algorithms, Automatic Indexing, Comparative Analysis, Computational Linguistics
Peer reviewedCantor, Jeffrey A. – Journal of Educational Technology Systems, 1988
Describes the Training Effectiveness Algorithm, a systematic procedure for identifying the cause of reported training problems which was developed for use in the U.S. Navy. A two-step review by subject matter experts is explained, and applications of the algorithm to other organizations and training systems are discussed. (Author/LRW)
Descriptors: Algorithms, Flow Charts, Formative Evaluation, Management Systems
Harper-Marinick, Maria; Gerlach, Vernon S. – Educational Technology, 1986
Describes a five-step set of procedures for designing and developing instruction that promotes student-teacher interaction and teacher responsiveness. The steps described address instructional content, objectives, questions, boundaries, and entry behavior. (MBR)
Descriptors: Algorithms, Behavioral Objectives, Course Content, Instructional Design
Peer reviewedFlanders, Harley – College Mathematics Journal, 1987
A program for drawing a line segment is developed. (MNS)
Descriptors: Algorithms, College Mathematics, Computer Graphics, Computer Software
Peer reviewedde Leeuw, Jan; Verhelst, Norman – Journal of Educational Statistics, 1986
Maximum likelihood procedures are presented for a general model to unify the various models and techniques that have been proposed for item analysis. Unconditional maximum likelihood estimation, proposed by Wright and Haberman, and conditional maximum likelihood estimation, proposed by Rasch and Andersen, are shown as important special cases. (JAZ)
Descriptors: Algorithms, Estimation (Mathematics), Item Analysis, Latent Trait Theory
Kameenui, Edward J.; Carnine, Douglas W. – Exceptional Child, 1986
Significant differences were found favoring skill-deficient second-graders (N=10) provided with repeated preteaching trials on a selected component skill of a subtraction algorithm before they worked the entire algorithm over students (N=10) who, from the beginning of training, received systematic instruction on working the entire algorithm.…
Descriptors: Algorithms, Computation, Grade 2, Learning Problems
Peer reviewedKowszun, Jorj; Higgo, John – Mathematics in School, 1986
Reports on the findings of the Algorithms working group at the Ware, England, conference. Examines methods of introducing the algorithmic approach to mathematics via computer programing and using problems arising from content areas. Considers programing language and presents support for programming in mathematics curricula. (JM)
Descriptors: Algorithms, Concept Formation, Curriculum Development, Learning Activities
Peer reviewedMislevy, Robert J. – Psychometrika, 1986
This article describes a Bayesian framework for estimation in item response models, with two-stage distributions on both item and examinee populations. Strategies for point and interval estimation are discussed, and a general procedure based on the EM algorithm is presented. (Author/LMO)
Descriptors: Algorithms, Bayesian Statistics, Estimation (Mathematics), Latent Trait Theory
Peer reviewedZaki, M.; Elboraey, F. – Information Processing and Management, 1985
Investigates applicability of inverted file processing in magnetic bubble memories by presenting four magnetic bubble memory models as storage mediums: one based on a major-minor loop configuration; one utilizing a decoder design on a magnetic bubble memory chip; and two based on different structural configurations of the first two. (MBR)
Descriptors: Algorithms, Classification, Computer Storage Devices, Data Processing
Peer reviewedGonzales, Michael G. – Computer Education, 1984
Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)
Descriptors: Algorithms, Classification, College Mathematics, Computer Programs
Peer reviewedGantner, T. E. – College Mathematics Journal, 1984
An efficient division algorithm is developed, using a computer program, to convert any positive fraction to its decimal representation. The computer program listing is included. (MNS)
Descriptors: Algebra, Algorithms, College Mathematics, Computer Software
Geis, George L. – Journal of Instructional Development, 1984
Discussion of checklists and their variations--job aids, algorithms, heuristics, and decision tables--covers what they are, how they are generated, and some implications of checklisting for instruction, evaluation, and learning. Examples of various kinds of checklists and 11 references are provided. (MBR)
Descriptors: Algorithms, Check Lists, Criteria, Curriculum Development
Peer reviewedEwbank, William A.; Ginther, John L. – Arithmetic Teacher, 1984
A collection of games and puzzles that teachers can use to replace or supplement the usual textbook subtraction examples involving large numbers is given. Most of the nine activities are self-checking. (MNS)
Descriptors: Algorithms, Computation, Drills (Practice), Educational Games
Peer reviewedHubbard, Sherry P.; Ashlock, Robert B. – Arithmetic Teacher, 1977
Symbols and shapes used in flowcharting are defined, reasons for incorporating flowcharts into instructional activities are listed, and eight different flowcharts are presented. (DT)
Descriptors: Algorithms, Elementary Education, Elementary School Mathematics, Flow Charts


