MétaCan
Menu
Back to cohort
Record W2115590028 · doi:10.1109/tai.1994.346460

Minimal forward checking

2002· article· en· W2115590028 on OpenAlexafffund
Michael J. Dent, Robert E. Mercer

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicConstraint Satisfaction and Optimization
Canadian institutionsWestern University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsHeuristicConstraint (computer-aided design)Constraint satisfaction problemComputer scienceDomain (mathematical analysis)Constraint satisfactionVariable (mathematics)Random variableMathematical optimizationSelection (genetic algorithm)AlgorithmTheoretical computer scienceMathematicsArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

Forward Checking (FC) is a highly regarded complete search algorithm used to solve constraint satisfaction problems. In this paper a lazy variant of FC called minimal forward checking (MFC) is introduced. MFC is a natural marriage of incremental FC and backchecking. Given a variable selection heuristic which does not depend on domain size MPC's worst case performance on any CSP instance is the number of constraint checks performed by FC. Experiments using hard random problems are presented which show that MFC outperforms FC especially for problems with large domain sizes and/or a large number of variables.>

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.011
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.010
Threshold uncertainty score0.033

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.011
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0020.002
Science and technology studies0.0020.003
Scholarly communication0.0020.004
Open science0.0030.004
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0100.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.022
GPT teacher head0.217
Teacher spread0.195 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations36
Published2002
Admission routes2
Has abstractyes

Explore more

Same topicConstraint Satisfaction and OptimizationFrench-language works237,207