NotesFAQContact Us
Collection
Advanced
Search Tips
What Works Clearinghouse Rating
Showing 2,311 to 2,325 of 2,728 results Save | Export
Magel, E. Terry – Computing Teacher, 1989
Discusses problems associated with teaching non-recursive binary searching in computer language classes, and describes a teacher-directed dialog based on dictionary use that helps students use their previous searching experiences to conceptualize the binary search process. Algorithmic development is discussed and appropriate classroom discussion…
Descriptors: Algorithms, Computer Science Education, Concept Formation, Dialogs (Language)
Peer reviewed Peer reviewed
O'Kane, Kevin C. – Information Processing & Management, 1996
Describes an algorithm for computer generation of hierarchical indexes for document collections. The resulting index, when presented with a graphical interface, provides users with a view of a document collection that permits general browsing and informal search activities via an access method that requires no keyboard entry or prior knowledge of…
Descriptors: Access to Information, Algorithms, Automatic Indexing, Computer Graphics
Peer reviewed Peer reviewed
Bachelis, Gregory F.; And Others – School Science and Mathematics, 1994
Presents cooperative computing activities in which each student plays the role of a switch or processor and acts out algorithms. Includes binary counting, finding the smallest card in a deck, sorting by selection and merging, adding and multiplying large numbers, and sieving for primes. (16 references) (Author/MKR)
Descriptors: Algorithms, Class Activities, Computer Science Education, Computers
Peer reviewed Peer reviewed
Page, Anita – Teaching Children Mathematics, 1994
Discusses using what students already know about taking away objects when teaching subtraction and gives six lessons to develop language for discussing and recording subtraction situations that give meaning to the subtraction algorithm. (MKR)
Descriptors: Algorithms, Charts, Elementary School Mathematics, Language Role
Peer reviewed Peer reviewed
Chen, L. T.; And Others – Information Systems, 1995
This paper addresses the problem of data management techniques for efficiently retrieving requested subsets of large data sets from mass storage devices. Describes the development of algorithms and software that facilitate the partitioning of a large data set into multiple "clusters" that reflect their expected access. (Author/JKP)
Descriptors: Algorithms, Computer Software Development, Data Processing, Database Management Systems
Peer reviewed Peer reviewed
Liou, Michelle; Chang, Chih-Hsin – Psychometrika, 1992
An extension is proposed for the network algorithm introduced by C.R. Mehta and N.R. Patel to construct exact tail probabilities for testing the general hypothesis that item responses are distributed according to the Rasch model. A simulation study indicates the efficiency of the algorithm. (SLD)
Descriptors: Algorithms, Computer Simulation, Difficulty Level, Equations (Mathematics)
Peer reviewed Peer reviewed
Luecht, Richard M.; Hirsch, Thomas M. – Applied Psychological Measurement, 1992
Derivations of several item selection algorithms for use in fitting test items to target information functions (IFs) are described. These algorithms, which use an average growth approximation of target IFs, were tested by generating six test forms and were found to provide reliable fit. (SLD)
Descriptors: Algorithms, Computer Assisted Testing, Equations (Mathematics), Goodness of Fit
Peer reviewed Peer reviewed
Egan, Vincent; Deary, Ian J. – Intelligence, 1992
To assess whether movement artifacts reported in visual inspection time (IT) tasks were under metacognitive control, 29 young adults in Edinburgh (Scotland) were tested on a dual-task paradigm in which IT was conducted along with a concurrent task. Reports of movement artifacts are not usually examples of metacognitive processing. (SLD)
Descriptors: Algorithms, Foreign Countries, Intelligence Quotient, Metacognition
Peer reviewed Peer reviewed
Eddy, William F.; Mockus, Audris – Journal of the American Society for Information Science, 1994
Describes animation algorithms for creating smooth functions of time- and space-varying phenomenon. The incidence of the disease mumps from 1968-88 in the United States is used to demonstrate the algorithms. Figures that illustrate the findings are included. (14 references) (KRN)
Descriptors: Algorithms, Animation, Display Systems, Functions (Mathematics)
Peer reviewed Peer reviewed
Jackling, Noel; And Others – Higher Education Research and Development, 1990
It is proposed that algorithms and heuristics are useful in improving professional problem-solving abilities when contextualized within the academic discipline. A basic algorithm applied to problem solving in undergraduate engineering education and a similar algorithm applicable to legal problems are used as examples. Problem complexity and…
Descriptors: Algorithms, Classroom Techniques, College Instruction, Curriculum Development
Peer reviewed Peer reviewed
Keeports, David – Mathematics Teacher, 1991
The four-color theorem stating that any map in a plane can be colored using no more than four colors represents a problem suitable for the liberal arts student. Presented is an algorithm for coloring familiar maps through the temporary removal of states bordering three or fewer states. (MDH)
Descriptors: Algorithms, College Mathematics, Enrichment Activities, Mathematical Enrichment
Peer reviewed Peer reviewed
Rost, Jurgen – Applied Psychological Measurement, 1990
Combining Rasch and latent class models is presented as a way to overcome deficiencies and retain the positive features of both. An estimation algorithm is outlined, providing conditional maximum likelihood estimates of item parameters for each class. The model is illustrated with simulated data and real data (n=869 adults). (SLD)
Descriptors: Adults, Algorithms, Computer Simulation, Equations (Mathematics)
Peer reviewed Peer reviewed
Muraki, Eiji – Applied Psychological Measurement, 1990
This study examined the application of the marginal maximum likelihood-EM algorithm to the parameter estimation problems of the normal ogive and logistic polytomous response models for Likert-type items. A rating scale model, based on F. Samejima's (1969) graded response model, was developed. (TJH)
Descriptors: Algorithms, Computer Simulation, Equations (Mathematics), Goodness of Fit
Landa, Lev N. – Educational Technology, 1998
After reviewing 50 educational software titles produced by 21 companies to assess how thinking and thinking skills were developed, the author found most had similar methodological drawbacks. Describes the algo-heuristic methodological position and outlines drawbacks of current software. (PEN)
Descriptors: Algorithms, Comparative Analysis, Computer Assisted Instruction, Computer Software Evaluation
McGaghie, William C. – 1996
The cognitive structure of 13 concepts in pulmonary physiology was explored among 112 first-year medical students and among 32 faculty members in three different expertise groups in a knowledge representation study. Purposes were to assess the degree of agreement among faculty members, map students' concept structures, and compare the similarity…
Descriptors: Algorithms, Cognitive Structures, Comparative Analysis, Higher Education
Pages: 1  |  ...  |  151  |  152  |  153  |  154  |  155  |  156  |  157  |  158  |  159  |  ...  |  182