NotesFAQContact Us
Collection
Advanced
Search Tips
What Works Clearinghouse Rating
Showing 1,351 to 1,365 of 2,733 results Save | Export
Peer reviewed Peer reviewed
Eberhart, James G. – School Science and Mathematics, 1994
Presents alternative equation-solving procedures that emphasize an examination of the steps or operations necessary to perform a calculation, followed by the inversion of those steps. The approach is especially attractive to students with limited mathematical skills. (Author/MKR)
Descriptors: Algebra, Algorithms, Equations (Mathematics), Learning Activities
Peer reviewed Peer reviewed
Arcavi, Abraham – For the Learning of Mathematics, 1994
Attempts to describe a notion parallel to number sense, called symbol sense, incorporating the following components: making friends with symbols, reading through symbols, engineering symbolic expressions, equivalent expressions for non-equivalent meanings, choice of symbols, flexible manipulation skills, symbols in retrospect, and symbols in…
Descriptors: Algebra, Algorithms, Mathematical Concepts, Mathematics Education
Peer reviewed Peer reviewed
Moffat, Alistair; Bell, Timothy A. H. – Journal of the American Society for Information Science, 1995
Discussion of index construction for large text collections highlights a new indexing algorithm designed to create large compressed inverted indexes "in situ." Topics include a computational model, inversion, index compression, merging, experimental test results, effect on retrieval performance, memory restrictions, and dynamic…
Descriptors: Algorithms, Automatic Indexing, Data Conversion, Information Retrieval
Snyder, Herbert; Kurtze, Douglas – Proceedings of the ASIS Annual Meeting, 1992
Discusses the use of chaos, or nonlinear dynamics, for investigating computer-mediated communication. A comparison between real, human-generated data from a computer network and similarly constructed random-generated data is made, and mathematical procedures for determining chaos are described. (seven references) (LRW)
Descriptors: Algorithms, Chaos Theory, Comparative Analysis, Computer Networks
Peer reviewed Peer reviewed
Schwalbe, Ted – ACA Bulletin, 1992
Describes an algorithm for course scheduling that can make the process much less time consuming for chairs and deans. Notes that long-term planning is possible because of the algorithm's two-year cycle. Notes that the algorithm can be programed easily by using a spreadsheet. (RS)
Descriptors: Algorithms, Educational Administration, Educational Planning, Higher Education
Peer reviewed Peer reviewed
McDonald, Roderick P.; Hartmann, Wolfgang M. – Multivariate Behavioral Research, 1992
An algorithm for obtaining initial values for the minimization process in covariance structure analysis is developed that is more generally applicable for computing parameters connected to latent variables than the currently existing ones. The algorithm is formulated in terms of the RAM model but can be extended. (SLD)
Descriptors: Algorithms, Correlation, Equations (Mathematics), Estimation (Mathematics)
Peer reviewed Peer reviewed
Arabie, Phipps – Psychometrika, 1991
The current state of multidimensional scaling using the city-block metric is reviewed, with attention to (1) substantive and theoretical issues; (2) recent algorithmic developments and their implications for analysis; (3) isometries with other metrics; (4) links to graph-theoretic models; and (5) prospects for future development. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Graphs, Literature Reviews
Peer reviewed Peer reviewed
Kiers, Henk A. L.; Takane, Yoshio – Psychometrika, 1993
The DEcomposition into DIrectional COMponents (DEDICOM) method for analysis of asymmetric data gives representations that are identified only up to a non-singular transformation. To identify solutions, it is proposed that subspace constraints be imposed on the stimulus coefficients. Procedures are discussed for several cases. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Least Squares Statistics, Mathematical Models
Peer reviewed Peer reviewed
Berger, Martijn P. F. – Journal of Educational Statistics, 1994
Problems in selection of optimal designs in item-response theory (IRT) models are resolved through a sequential design procedure that is a modification of the D-optimality procedure proposed by Wynn (1970). This algorithm leads to consistent estimates, and the errors in selecting the abilities generally do not greatly affect optimality. (SLD)
Descriptors: Ability, Algorithms, Estimation (Mathematics), Item Response Theory
Balas, Janet L. – Computers in Libraries, 1999
Reviews Web-search tools available to librarians. Discusses the Clever project, (part of the Computer Science Principles and Methodologies Department at the IBM Almaden Research Center, Silicon Valley, California), an algorithm that finds authoritative sources on the Web; Google technology, based on links between Web pages; Ask Jeeves, a…
Descriptors: Algorithms, Information Retrieval, Information Sources, Library Services
Peer reviewed Peer reviewed
Davis, Charles H.; McKim, Geoffrey W. – Journal of the American Society for Information Science, 1999
Describes SWEAR (Systematic Weighting and Ranking), a powers-of-two algorithm that can be used for searching the World Wide Web or any large database that automatically creates discrete, well-defined result sets and displays them in decreasing order of likely relevance. Also discusses fuzzy sets. (Author/LRW)
Descriptors: Algorithms, Databases, Information Retrieval, Relevance (Information Retrieval)
Peer reviewed Peer reviewed
Jeong, Kil Soon; Myaeng, Sung Hyon; Lee, Jae Sung; Choi, Key-Sun – Information Processing & Management, 1999
Discusses problems that occur in information retrieval when foreign words appear in Korean texts. Describes an algorithm that identifies a phrase containing a foreign word and then extracts that word based on statistical information, and explains a method for back-transliteration of a foreign word to its English origin. (Author/LRW)
Descriptors: Algorithms, Information Retrieval, Korean, Problems
Peer reviewed Peer reviewed
Thorburn, Gareth; Rowe, Glenn – Computers & Education, 1997
Unlike most program assessment systems, Program Assessment using Specified Solutions (PASS), evaluates student C programs by assessing the way a problem was solved by performing a comparison of the submitted program with a solution plan. This article describes PASS, its use of instructor specified solution plans, assessment and feedback systems,…
Descriptors: Algorithms, Automation, Computer Science Education, Computer Software Evaluation
Peer reviewed Peer reviewed
Foster, Robin – Mathematics in School, 1998
Indicates that there has been a lot of work done and that a great deal needs to be done in the future to explore the world of children's early number. Discusses the counting, the use of algorithm, practical mathematics, the use of manipulatives, individual differences and pedagogical concerns, and classroom applications. Contains 18 references.…
Descriptors: Algorithms, Computation, Elementary Education, Manipulative Materials
Peer reviewed Peer reviewed
Baker, Bruce D. – Economics of Education Review, 2001
Explores whether flexible nonlinear models (including neural networks and genetic algorithms) can reveal otherwise unexpected patterns of relationship in typical school-productivity data. Applying three types of algorithms alongside regression modeling to school-level data in 183 elementary schools proves the hypothesis and reveals new directions…
Descriptors: Algorithms, Elementary Education, Evaluation Methods, Mathematical Models
Pages: 1  |  ...  |  87  |  88  |  89  |  90  |  91  |  92  |  93  |  94  |  95  |  ...  |  183