MétaCan
Menu
Back to cohort
Record W2058294560 · doi:10.1145/568438.568443

Review of <b>How to Solve It: Modern Heuristics</b>

2001· article· en· W2058294560 on OpenAlexaff
Hassan Masum

Bibliographic record

VenueACM SIGACT News · 2001
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsCarleton University
Fundersnot available
KeywordsHeuristicsComputer scienceHeuristicKey (lock)Fuzzy logicPresentation (obstetrics)Process (computing)Artificial intelligenceManagement scienceProgramming language

Abstract

fetched live from OpenAlex

How to Solve It is a friendly gem of a book which introduces the basic principles of traditional optimization, evolutionary optimization, neural nets, and fuzzy methods. In the spirit of Polya's classic of the same name, the authors emphasize the "how and why" of the problem-solving process, constantly prodding the reader to stop and solve subproblems, or come up with new heuristics, or indeed question whether or not the problem has been posed correctly in the first place.This book is clear, concise, and fun to read. It is not a handbook of heuristics, but rather an accessible high-level overview of the pros, cons, and applicability of the major categories of heuristic methods, with particular emphasis on optimization methods utilizing evolutionary computation. The presentation is lucid, and the authors do a good job of picking out key properties of algorithms and problem domains. The only prerequisites are basic mathematics and some problem-solving talent.

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.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Review · Consensus signal: Review
Teacher disagreement score0.012
Threshold uncertainty score0.041

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.003
Science and technology studies0.0010.001
Scholarly communication0.0030.004
Open science0.0010.001
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0120.013

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.063
GPT teacher head0.342
Teacher spread0.278 · 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 designNot applicable
Domainnot available
GenreReview

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

Citations6
Published2001
Admission routes1
Has abstractyes

Explore more

Same venueACM SIGACT NewsSame topicMetaheuristic Optimization Algorithms ResearchFrench-language works237,207