MétaCan
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.

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
Proceedings of the International Conference on Automated Planning and Scheduling
Topic
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.

93 results · 1 filter active ·
Results by year
20092025
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.
93 works in the cohort · of 4,299,418page 1 of 2

Labels cover 0 of 93 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 93 of 93 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

afffundunlabeled
Improved Non-Deterministic Planning by Exploiting State Relevance
Christian Muise, Sheila A. McIlraith, J. Christopher Beck
2012· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
110
citations
affunlabeled
A Multi-Label A* Algorithm for Multi-Agent Pathfinding
Florian Grenouilleau, Willem‐Jan van Hoeve, John Hooker
2019· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
69
citations
affunlabeled
Incremental Policy Generation for Finite-Horizon DEC-POMDPs
Christopher Amato, Jilles Dibangoye, Shlomo Zilberstein
2009· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
64
citations
afffundunlabeled
Finite LTL Synthesis as Planning
Alberto Rivas, Jorge A. Baier, Christian Muise, Sheila A. McIlraith
2018· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
58
citations
affunlabeled
Planning Modulo Theories: Extending the Planning Paradigm
Peter Gregory, Derek Long, Maria Fox, J. Christopher Beck
2012· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
58
citations
affunlabeled
Closing the Gap: Improved Bounds on Optimal POMDP Solutions
Pascal Poupart, Kee-Eung Kim, Dongho Kim
2011· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
50
citations
affunlabeled
Improved Features for Runtime Prediction of Domain-Independent Planners
Chris Fawcett, Mauro Vallati, Frank Hutter, Jörg Hoffmann, Holger H. Hoos, Kevin Leyton‐Brown
2014· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
affunlabeled
Linear Fitted-Q Iteration with Multiple Reward Functions
Daniel J. Lizotte, Michael Bowling, Susan A. Murphy
2013· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Economics, Econometrics and Finance
distilled prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Probabilistic Robust Multi-Agent Path Finding
Dor Atzmon, Roni Stern, Ariel Felner, Nathan Sturtevant, Sven Koenig
2020· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
38
citations
affunlabeled
Online Repositioning in Bike Sharing Systems
Meghna Lowalekar, Pradeep Varakantham, S. K. Ghosh, Sanjay Dominik Jena, Patrick Jaillet
2017· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Social Sciences
distilled prediction:candidate · noneconsensus · none
33
citations
afffundunlabeled
Towards a Unified View of AI Planning and Reactive Synthesis
Alberto Rivas, Meghyn Bienvenu, Sheila A. McIlraith
2019· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
31
citations
afffundunlabeled
Non-Deterministic Planning With Conditional Effects
Christian Muise, Sheila A. McIlraith, Vaishak Belle
2014· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affunlabeled
Using Alternative Suboptimality Bounds in Heuristic Search
Richard Valenzano, Shahab Jabbari Arfaee, Jordan Thayer, Roni Stern, Nathan Sturtevant
2013· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affunlabeled
Planning Via Random Walk-Driven Local Search
Fan Xie, Hootan Nakhost, Martin Müller
2012· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
fundno affunlabeled
Moving Target Search with Subgoal Graphs
Doron Nussbaum, Alper Yörükçü
2015· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
Scheduling an Aircraft Repair Shop
Maliheh Aramon Bajestani, J. Christopher Beck
2011· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Engineering
distilled prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
Optimally Relaxing Partial-Order Plans with MaxSAT
Christian Muise, Sheila A. McIlraith, J. Christopher Beck
2012· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
Conflict-Based Increasing Cost Search
Thayne T. Walker, Nathan Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, Tushar Kumar
2021· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Decision Sciences
distilled prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Computing Robust Plans in Continuous Domains
Christian Fritz, Sheila A. McIlraith
2009· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled 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
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Planning for Temporally Extended Goals in Pure-Past Linear Temporal Logic
Luigi Bonassi, Giuseppe De Giacomo, Marco Favorito, Francesco Fuggitti, Alfonso Gerevini, Enrico Scala
2023· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Learning Scheduling Models from Event Data
Arik Senderovich, Kyle E. C. Booth, J. Christopher Beck
2019· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Business, Management and Accounting
distilled prediction:candidate · noneconsensus · none
8
citations
afffundunlabeled
Understanding and Improving Local Exploration for GBFS
Fan Xie, Martin Müller, Robert C. Holte
2015· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundunlabeled
Multi-Agent Path Finding with Temporal Jump Point Search
Shuli Hu, Daniel Harabor, Graeme Gange, Peter J. Stuckey, Nathan Sturtevant
2022· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
LM-Cut Heuristics for Optimal Linear Numeric Planning
Ryo Kuroiwa, Alexander Shleyfman, J. Christopher Beck
2022· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Boosting Search Guidance in Problems with Semantic Attachments
Sara Bernardini, Maria Fox, Derek Long, Chiara Piacentini
2017· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations

How this was built: Screen · Findings · About