MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
→
Sort
Language
Type
Field
Venue
Topic
Metaheuristic Optimization Algorithms Research
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

762 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
762 works in the cohort · of 4,299,418page 7 of 16

Labels cover 0 of 762 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 762 of 762 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Swarm hyperheuristic framework
Surafel Luleseged Tilahun, Mohamed A. Tawhid
2018· article· fr· Journal of Heuristics· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
The Compressed Differential Heuristic
Meir Goldenberg, Nathan Sturtevant, Ariel Felner, Jonathan Schaeffer
2011· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
venueno affunlabeled
Artificial God Optimization - A Creation
Satish Gajawada, Hassan M. H. Mustafa
2020· article· en· Computer and Information Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Beam Search: Faster and Monotonic
Sofia Lemons, Carlos Linares López, Robert C. Holte, Wheeler Ruml
2022· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
The Compressed Differential Heuristic
Meir Goldenberg, Nathan Sturtevant, Ariel Felner, Jonathan Schaeffer
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Discrete Coordinate Descent (DCD)
Davood Zaman Farsa, Shahryar Rahnamayan
2020· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affvenueunlabeled
Efficiency competition on N-queen problem: DE vs. CMA-ES
Shahryar Rahnamayan, Paul Dieras
2008· article· en· Conference proceedings - Canadian Conference on Electrical and Computer Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Genetic Algorithms for Continuous Problems
J.R. Parker
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundunlabeled
Option pricing using Particle Swarm Optimization
Girish Kumar Jha, Sameer Kumar, Hari Prasain, Parimala Thulasiraman, Ruppa K. Thulasiraman
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Learning and Intelligent Optimization
Ilias Kotsireas, Pãnos M. Pardalos
2020· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Single-Frontier Bidirectional Search
Carsten Moldenhauer, Ariel Felner, Nathan Sturtevant, Jonathan Schaeffer
2010· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Designing Parallel Meta-Heuristic Methods
Teodor Gabriel Crainic, Tatjana Davidović, Dušan Ramljak
2014· book-chapter· en· Advances in systems analysis, software engineering, and high performance computing book series· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
← previousnext →

How this was built: Screen · Findings · About