NotesFAQContact Us
Collection
Advanced
Search Tips
Laws, Policies, & Programs
What Works Clearinghouse Rating
Showing 61 to 75 of 145 results Save | Export
Peer reviewed Peer reviewed
Nageswara Rao, S. V.; And Others – Information Processing and Management, 1985
Discusses properties of multiple attribute tree (MAT) and inverted file structures; establishes suitability of MAT data structure for bibliographic files using worst-case performance measures; provides arguments to establish MAT average case superiority; and proposes an efficient adaptation of MAT data structure to exploit special features of MAT…
Descriptors: Algorithms, Comparative Analysis, Data Processing, Databases
Lea, Wayne A. – Mechanical Translation, 1966
Research supported by grants from the National Science Foundation and the Joint Services Electronics Program. (DD)
Descriptors: Algorithms, Comparative Analysis, Grammar, Graphs
Peer reviewed Peer reviewed
Ritzman, Larry P. – Management Science, 1972
Descriptors: Administration, Algorithms, Building Design, Comparative Analysis
Peer reviewed Peer reviewed
Lopez-Pujalte, Cristina; Guerrero-Bote, Vicente P.; de Moya-Anegon, Felix – Journal of the American Society for Information Science and Technology, 2003
Discusses genetic algorithms in information retrieval, especially for relevance feedback, and evaluates the efficacy of a genetic algorithm with various order-based fitness functions for relevance feedback in a test database. Compares results with the Ide dec-hi method, one of the best traditional methods. (Contains 56 references.) (Author/LRW)
Descriptors: Algorithms, Comparative Analysis, Databases, Genetics
Peer reviewed Peer reviewed
Eastman, Caroline M. – Information Processing and Management, 1989
Compares the performance of inverted and signature file organizations in handling incrementally specified Boolean queries to an information retrieval system. The discussion covers the impact of more sophisticated signature file organizations, related problems, and possible future work. (65 references) (CLB)
Descriptors: Algorithms, Comparative Analysis, Database Management Systems, 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
Kant, Elaine; Newell, Allen – Information Processing and Management, 1984
Presents model of algorithm design (activity in software development) based on analysis of protocols of two subjects designing three convex hull algorithms. Automation methods, methods for studying algorithm design, role of discovery in problem solving, and comparison of different designs of case study according to model are highlighted.…
Descriptors: Algorithms, Automation, Case Studies, Comparative Analysis
Peer reviewed Peer reviewed
Harris, Margaret L.; Harris, Chester W. – Educational and Psychological Measurement, 1971
Descriptors: Algorithms, Comparative Analysis, Factor Analysis, Factor Structure
Peer reviewed Peer reviewed
Wager, Walter – Journal of Educational Technology Systems, 1981
This review of four different computer-assisted instruction algorithms concludes that current authoring guides are more concerned with "user orientation" than with instructional principles, and advocates the application of a design model based on Gagne's information processing model of instruction. Nine references are listed. (MER)
Descriptors: Algorithms, Comparative Analysis, Computer Assisted Instruction, Epistemology
Peer reviewed Peer reviewed
Tamine, Lynda; Chrisment, Claude; Boughanem, Mohand – Information Processing & Management, 2003
Explains the use of genetic algorithms to combine results from multiple query evaluations to improve relevance in information retrieval. Discusses niching techniques, relevance feedback techniques, and evolution heuristics, and compares retrieval results obtained by both genetic multiple query evaluation and classical single query evaluation…
Descriptors: Algorithms, Comparative Analysis, Evolution, Genetics
Peer reviewed Peer reviewed
Schnipke, Deborah L.; Green, Bert F. – Journal of Educational Measurement, 1995
Two item selection algorithms, one based on maximal differentiation between examinees and one based on item response theory and maximum information for each examinee, were compared in simulated linear and adaptive tests of cognitive ability. Adaptive tests based on maximum information were clearly superior. (SLD)
Descriptors: Adaptive Testing, Algorithms, Comparative Analysis, Item Response Theory
Peer reviewed Peer reviewed
Danilowicz, Czeslaw – Information Processing and Management, 1994
Discusses end-user searching in Boolean information retrieval systems considers the role of search intermediaries and proposes a model of user preferences that incorporates a user's profile. Highlights include document representation; information queries; document output ranking; calculating user profiles; and selecting documents for a local…
Descriptors: Algorithms, Comparative Analysis, Databases, Information Retrieval
Peer reviewed Peer reviewed
Vassilakopoulos, Michael; Manolopoulos, Yannis – Information Systems, 1995
Presents an improved inverted region quadtree variation called Dynamic Inverted Quadtree that is able to support and index a pictorial database. Pattern-searching algorithms are described, and the space needs of Fully Inverted and Dynamic Inverted Quadtrees are analytically compared based on a model of image randomness expressed as a branching…
Descriptors: Algorithms, Branching, Comparative Analysis, Computer System Design
Peer reviewed Peer reviewed
Lin, Jianhua; Storer, James A. – Information Processing & Management, 1994
Describes the design of optimal tree-structured vector quantizers that minimize the expected distortion subject to cost functions related to storage cost, encoding rate, or quantization time. Since the optimal design problem is intractable in most cases, the performance of a general design heuristic based on successive partitioning is analyzed.…
Descriptors: Algorithms, Coding, Comparative Analysis, Costs
Peer reviewed Peer reviewed
Cureton, Edward E.; Mulaik, Stanley A. – Psychometrika, 1975
Applications to the Promax Rotation are discussed, and it is shown that these procedures solve Thurstone's hitherto intractable "invariant" box problem as well as other more common problems based on real data. (Author/RC)
Descriptors: Algorithms, Comparative Analysis, Factor Analysis, Factor Structure
Pages: 1  |  2  |  3  |  4  |  5  |  6  |  7  |  8  |  9  |  10