NotesFAQContact Us
Collection
Advanced
Search Tips
What Works Clearinghouse Rating
Showing 2,026 to 2,040 of 2,843 results Save | Export
Peer reviewed Peer reviewed
Bissett, Randall; Schneider, Bruce – Psychometrika, 1991
The algorithm developed by B. A. Schneider (1980) for analysis of paired comparisons of psychological intervals is replaced by one proposed by R. M. Johnson. Monte Carlo simulations of pairwise dissimilarities and pairwise conjoint effects show that Johnson's algorithm can provide good metric recovery. (SLD)
Descriptors: Algorithms, Comparative Analysis, Computer Simulation, Equations (Mathematics)
Peer reviewed Peer reviewed
Kamii, Constance; And Others – Educational Horizons, 1991
Based on Piaget's theory that children acquire number concepts by constructing them from within, the authors conclude that teaching algorithms harms mathematics learning. A better approach is allowing them to construct their own logico-mathematical knowledge and invent their own efficient procedures. (JOW)
Descriptors: Algorithms, Computation, Educational Change, Educational Strategies
Travis, Betty – Collegiate Microcomputer, 1991
Presents a description and evaluation of a microcomputer-based system designed to diagnose errors in basic algorithmic procedures made by students in a college remedial mathematics class. The paper-and-pencil diagnostic test is described, and results of pretests and posttests for the computer group and control group are discussed. (five…
Descriptors: Algorithms, Computer Assisted Testing, Computer Software Evaluation, Diagnostic Tests
Peer reviewed Peer reviewed
Cudeck, Robert – Journal of Educational Statistics, 1991
Two algorithms that automatically select subsets of variables (PACE algorithm) and reference variables (Fabin estimators), respectively, used for the noniterative estimators are presented. The PACE algorithm is based on a nonsymmetric matrix sweep operator. A Monte Carlo experiment compares the relative performance of these estimators and others.…
Descriptors: Algorithms, Comparative Analysis, Equations (Mathematics), Estimation (Mathematics)
Peer reviewed Peer reviewed
Bookstein, Abraham; And Others – Information Processing and Management, 1992
Describes the use of loglinear statistical models in the field of informetrics, especially for the analysis of information systems. A detailed example is given of developing a model based on loglinear analysis to determine book acquisition patterns in libraries, including mathematical considerations and algorithms. (19 references) (LRW)
Descriptors: Algorithms, Information Retrieval, Information Science, Information Systems
Peer reviewed Peer reviewed
Schweizer, Karl – Multivariate Behavioral Research, 1991
A mathematical formula is introduced for the effect of integrating data. A method is then derived to eliminate the effect from correlations of variables, including mean composites, thus allowing for a clustering algorithm that requires allocation of variables according to the magnitude of their correlations. Examples illustrate the procedure. (SLD)
Descriptors: Algorithms, Classification, Cluster Analysis, Computer Simulation
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
Peer reviewed Peer reviewed
Gfeller, Mary K.; Niess, Margaret L.; Lederman, Norman G. – School Science and Mathematics, 1999
Examines solutions presented by preservice teachers for solving graphical and numerical problems involving the arithmetic mean. Participants presented two methods: algorithmic computation and balancing deviations about the mean. A significant difference was found between science and mathematics preservice teachers in the use of balancing…
Descriptors: Algorithms, Higher Education, Mathematics Education, Preservice Teacher Education
Dempsey, Deirdre; Marshall, John – Phi Delta Kappan, 2001
An education major enrolled in a mathematics education course ponders confusing definitions of "multiplication" functions in dictionaries and in a handout on Euclid. This student teacher wants to teach elementary students what multiplication really is, not just impart an algorithmic skill. (MLH)
Descriptors: Algorithms, Definitions, Dictionaries, Education Majors
Peer reviewed Peer reviewed
Cohen, Sara; Kanza, Yaron; Kogan, Yakov; Sagiv, Yehoshua; Nutt, Werner; Serebrenik, Alexander – Journal of the American Society for Information Science and Technology, 2002
Describes EquiX, a search language for XML that combines querying with searching to query the data and the meta-data content of Web pages. Topics include search engines; a data model for XML documents; search query syntax; search query semantics; an algorithm for evaluating a query on a document; and indexing EquiX queries. (LRW)
Descriptors: Algorithms, Evaluation Methods, Indexing, Information Retrieval
Gallagher, Ann; Mandinach, Ellen – 1992
Twenty-four students who scored 650 or more on the Scholastic Aptitude Test Mathematics test (SAT-M) were asked to think aloud while solving 13 mathematics items in either multiple-choice or free-response format. Strategies students used to solve the items were classified as either algorithmic or insightful. Data analyses indicated that items in…
Descriptors: Algorithms, College Students, Higher Education, Mathematics Tests
Yan, Duanli; Lewis, Charles; Stocking, Martha – 1998
It is unrealistic to suppose that standard item response theory (IRT) models will be appropriate for all new and currently considered computer-based tests. In addition to developing new models, researchers will need to give some attention to the possibility of constructing and analyzing new tests without the aid of strong models. Computerized…
Descriptors: Adaptive Testing, Algorithms, Computer Assisted Testing, Item Response Theory
Niaz, Mansoor – 1994
The main objective of this study is to construct models based on strategies students use to solve chemistry problems and to show that these models form sequences of progressive transitions similar to what Lakatos (1970) in the history of science refers to as progressive 'problemshifts' that increase the explanatory' heuristic power of the models.…
Descriptors: Algorithms, Chemistry, Classroom Research, Concept Formation
Pages: 1  |  ...  |  132  |  133  |  134  |  135  |  136  |  137  |  138  |  139  |  140  |  ...  |  190