Publication Date
In 2025 | 0 |
Since 2024 | 0 |
Since 2021 (last 5 years) | 0 |
Since 2016 (last 10 years) | 1 |
Since 2006 (last 20 years) | 3 |
Descriptor
Computation | 3 |
Heuristics | 3 |
Programming | 3 |
Abstract Reasoning | 1 |
Biology | 1 |
Computer Science Education | 1 |
Constructivism (Learning) | 1 |
Data Analysis | 1 |
Databases | 1 |
Design | 1 |
Difficulty Level | 1 |
More ▼ |
Author
Brusco, Michael J. | 1 |
Heffernan, John | 1 |
Kohn, Hans-Friedrich | 1 |
Pema, Enela | 1 |
Stahl, Stephanie | 1 |
Sullivan, Florence R. | 1 |
Publication Type
Journal Articles | 2 |
Reports - Research | 2 |
Dissertations/Theses -… | 1 |
Information Analyses | 1 |
Education Level
Elementary Secondary Education | 1 |
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Pema, Enela – ProQuest LLC, 2014
An inconsistent database is a database that violates one or more of its integrity constraints. In reality, violations of integrity constraints arise frequently under several different circumstances. Inconsistent databases have long posed the challenge to develop suitable tools for meaningful query answering. A principled approach for querying…
Descriptors: Databases, Integrity, Reliability, Online Searching
Sullivan, Florence R.; Heffernan, John – Journal of Research on Technology in Education, 2016
This article presents a systematic review of research related to the use of robotics construction kits (RCKs) in P-12 learning in the STEM disciplines for typically developing children. The purpose of this review is to configure primarily qualitative and mixed methods findings from studies meeting our selection and quality criterion to answer the…
Descriptors: Robotics, Manipulative Materials, STEM Education, Elementary Secondary Education
Brusco, Michael J.; Kohn, Hans-Friedrich; Stahl, Stephanie – Psychometrika, 2008
Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30x30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation…
Descriptors: Heuristics, Programming, Data Analysis, Matrices