{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/heuristic-search/papers/3","list_of":"/task/heuristic-search","task":"Heuristic Search","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":3,"rows_per_page":100,"rows":[201,261],"of":261,"counts":{"archive_papers_tagged":261,"with_a_code_link":76,"where_syntology_ran_a_sample":15,"not_listed_spam_title":0,"listed":261,"listed_where_code_ran":15,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/heuristic-search","prev":"/task/heuristic-search/papers/2","next":null,"papers":[{"url":null,"slug":"a-hybrid-evolutionary-algorithm-framework-for","title":"A Hybrid Evolutionary Algorithm Framework for Optimising Power Take Off and Placements of Wave Energy Converters","date":"2019-04-15","arxiv_id":"1904.07043","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-risk-bounded-motion-planning-for","title":"Online Risk-Bounded Motion Planning for Autonomous Vehicles in Dynamic Environments","date":"2019-04-04","arxiv_id":"1904.02341","repositories_listed":0,"syntology":null},{"url":null,"slug":"tackling-the-qubit-mapping-problem-for-nisq","title":"Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices","date":"2019-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-one-class-support-vector-machine","title":"A One-Class Support Vector Machine Calibration Method for Time Series Change Point Detection","date":"2019-02-18","arxiv_id":"1902.06361","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-deep-learning-and-qualitative","title":"Combining Deep Learning and Qualitative Spatial Reasoning to Learn Complex Structures from Sparse Examples with Noise","date":"2018-11-27","arxiv_id":"1811.11064","repositories_listed":0,"syntology":null},{"url":null,"slug":"mean-based-heuristic-search-for-real-time","title":"Mean-based Heuristic Search for Real-Time Planning","date":"2018-10-22","arxiv_id":"1810.09150","repositories_listed":0,"syntology":null},{"url":null,"slug":"path-finding-for-the-coalition-of-co","title":"Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles","date":"2018-07-02","arxiv_id":"1807.00771","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-actor-search-tree-critic-astc-for-off","title":"The Actor Search Tree Critic (ASTC) for Off-Policy POMDP Learning in Medical Decision Making","date":"2018-05-29","arxiv_id":"1805.11548","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristics-for-vehicle-routing-problems","title":"Heuristics for vehicle routing problems: Sequence or set optimization?","date":"2018-03-16","arxiv_id":"1803.06062","repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-deep-neural-networks","title":"Testing Deep Neural Networks","date":"2018-03-10","arxiv_id":"1803.04792","repositories_listed":0,"syntology":null},{"url":null,"slug":"get-your-workload-in-order-game-theoretic","title":"Get Your Workload in Order: Game Theoretic Prioritization of Database Auditing","date":"2018-01-22","arxiv_id":"1801.07215","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-heuristic-search-algorithm-using-the","title":"A Heuristic Search Algorithm Using the Stability of Learning Algorithms in Certain Scenarios as the Fitness Function: An Artificial General Intelligence Engineering Approach","date":"2017-12-08","arxiv_id":"1712.03043","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-importance-sampling-for-anytime","title":"Dynamic Importance Sampling for Anytime Bounds of the Partition Function","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristic-search-for-structural-constraints","title":"Heuristic Search for Structural Constraints in Data Association","date":"2017-11-08","arxiv_id":"1711.02823","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-discrimination-power-and-effective","title":"On the Discrimination Power and Effective Utilization of Active Learning Measures in Version Space Search","date":"2017-09-22","arxiv_id":"1709.07899","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-mixed-model-workplace-time-dependent","title":"Solving Mixed Model Workplace Time-dependent Assembly Line Balancing Problem with FSS Algorithm","date":"2017-07-19","arxiv_id":"1707.06132","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-machine-translation-with-gumbel-greedy","title":"Neural Machine Translation with Gumbel-Greedy Decoding","date":"2017-06-22","arxiv_id":"1706.07518","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-formal-characterization-of-the-local-search","title":"A Formal Characterization of the Local Search Topology of the Gap Heuristic","date":"2017-05-12","arxiv_id":"1705.04665","repositories_listed":0,"syntology":null},{"url":null,"slug":"numerical-integration-and-dynamic","title":"Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains","date":"2017-03-13","arxiv_id":"1703.04232","repositories_listed":0,"syntology":null},{"url":null,"slug":"generation-of-near-optimal-solutions-using","title":"Generation of Near-Optimal Solutions Using ILP-Guided Sampling","date":"2016-08-03","arxiv_id":"1608.01093","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-efficient-task-assignment-and-motion","title":"Toward Efficient Task Assignment and Motion Planning for Large Scale Underwater Mission","date":"2016-04-17","arxiv_id":"1604.04854","repositories_listed":0,"syntology":null},{"url":null,"slug":"finetuning-randomized-heuristic-search-for-2d","title":"Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The Best Input Parameters For R* Algorithm Through Series Of Experiments","date":"2015-11-03","arxiv_id":"1511.00840","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-based-diversity-optimization-for","title":"Feature-Based Diversity Optimization for Problem Instance Classification","date":"2015-10-29","arxiv_id":"1510.08568","repositories_listed":0,"syntology":null},{"url":null,"slug":"perch-perception-via-search-for-multi-object","title":"PERCH: Perception via Search for Multi-Object Recognition and Localization","date":"2015-10-19","arxiv_id":"1510.05613","repositories_listed":0,"syntology":null},{"url":null,"slug":"web-search-result-clustering-based-on","title":"Web Search Result Clustering based on Heuristic Search and k-means","date":"2015-08-11","arxiv_id":"1508.02552","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-linear-belief-compression-of-pomdps-a","title":"On the Linear Belief Compression of POMDPs: A re-examination of current methods","date":"2015-08-05","arxiv_id":"1508.00986","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-genetic-algorithm-for","title":"An Efficient Genetic Algorithm for Discovering Diverse-Frequent Patterns","date":"2015-07-19","arxiv_id":"1507.05275","repositories_listed":0,"syntology":null},{"url":null,"slug":"grid-based-angle-constrained-path-planning","title":"Grid-based angle-constrained path planning","date":"2015-06-05","arxiv_id":"1506.01864","repositories_listed":0,"syntology":null},{"url":null,"slug":"transition-based-syntactic-linearization","title":"Transition-Based Syntactic Linearization","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"influence-optimistic-local-values-for","title":"Influence-Optimistic Local Values for Multiagent Planning --- Extended Version","date":"2015-02-18","arxiv_id":"1502.05443","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-directional-shape-correspondences-bsc-a","title":"Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?","date":"2014-12-21","arxiv_id":"1412.6759","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-heuristic-search-algorithm-for-solving","title":"A Heuristic Search Algorithm for Solving First-Order MDPs","date":"2014-08-09","arxiv_id":"1408.2027","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-acrostics-via-paraphrasing-and","title":"Generating Acrostics via Paraphrasing and Heuristic Search","date":"2014-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cascading-a-a-parallel-approach-to","title":"Cascading A*: a Parallel Approach to Approximate Heuristic Search","date":"2014-06-04","arxiv_id":"1406.0955","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-optima-networks-a-new-model-of","title":"Local Optima Networks: A New Model of Combinatorial Fitness Landscapes","date":"2014-02-12","arxiv_id":"1402.2959","repositories_listed":0,"syntology":null},{"url":null,"slug":"homotopy-based-algorithms-for-ell_0","title":"Homotopy based algorithms for $\\ell_0$-regularized least-squares","date":"2014-01-31","arxiv_id":"1406.4802","repositories_listed":0,"syntology":null},{"url":null,"slug":"avoiding-and-escaping-depressions-in-real","title":"Avoiding and Escaping Depressions in Real-Time Heuristic Search","date":"2014-01-23","arxiv_id":"1401.5854","repositories_listed":0,"syntology":null},{"url":null,"slug":"colin-planning-with-continuous-linear-numeric","title":"COLIN: Planning with Continuous Linear Numeric Change","date":"2014-01-23","arxiv_id":"1401.5857","repositories_listed":0,"syntology":null},{"url":null,"slug":"best-first-heuristic-search-for-multicore","title":"Best-First Heuristic Search for Multicore Machines","date":"2014-01-16","arxiv_id":"1401.3861","repositories_listed":0,"syntology":null},{"url":null,"slug":"case-based-subgoaling-in-real-time-heuristic","title":"Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding","date":"2014-01-16","arxiv_id":"1401.3857","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-abstraction-heuristics","title":"Implicit Abstraction Heuristics","date":"2014-01-16","arxiv_id":"1401.3853","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-line-planning-and-scheduling-an","title":"On-line Planning and Scheduling: An Application to Controlling Modular Printers","date":"2014-01-16","arxiv_id":"1401.3875","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-lama-planner-guiding-cost-based-anytime","title":"The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks","date":"2014-01-16","arxiv_id":"1401.3839","repositories_listed":0,"syntology":null},{"url":null,"slug":"topological-value-iteration-algorithms","title":"Topological Value Iteration Algorithms","date":"2014-01-16","arxiv_id":"1401.3910","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-heuristic-search-approach-to-planning-with","title":"A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains","date":"2014-01-15","arxiv_id":"1401.3428","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-planning-algorithms-for-pomdps","title":"Online Planning Algorithms for POMDPs","date":"2014-01-15","arxiv_id":"1401.3436","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-anytime-algorithms-for-learning","title":"Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks","date":"2013-09-26","arxiv_id":"1309.6844","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-success-rate-of-crossover-operators","title":"On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection","date":"2013-09-23","arxiv_id":"1309.5896","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-partner-units-configuration-problem","title":"The Partner Units Configuration Problem: Completing the Picture","date":"2013-08-28","arxiv_id":"1308.6206","repositories_listed":0,"syntology":null},{"url":null,"slug":"search-space-characterization-for-real-time","title":"Search-Space Characterization for Real-time Heuristic Search","date":"2013-08-15","arxiv_id":"1308.3309","repositories_listed":0,"syntology":null},{"url":null,"slug":"inconsistency-and-accuracy-of-heuristics-with","title":"Inconsistency and Accuracy of Heuristics with A* Search","date":"2013-07-08","arxiv_id":"1307.2200","repositories_listed":0,"syntology":null},{"url":null,"slug":"defeasible-decisions-what-the-proposal-is-and","title":"Defeasible Decisions: What the Proposal is and isn't","date":"2013-03-27","arxiv_id":"1304.1518","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristic-search-as-evidential-reasoning","title":"Heuristic Search as Evidential Reasoning","date":"2013-03-27","arxiv_id":"1304.1509","repositories_listed":0,"syntology":null},{"url":null,"slug":"ideal-reformulation-of-belief-networks","title":"Ideal Reformulation of Belief Networks","date":"2013-03-27","arxiv_id":"1304.1089","repositories_listed":0,"syntology":null},{"url":null,"slug":"induction-of-and-by-probability","title":"Induction, of and by Probability","date":"2013-03-27","arxiv_id":"1304.3433","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-optimality-of-satisficing-solutions","title":"The Optimality of Satisficing Solutions","date":"2013-03-27","arxiv_id":"1304.2356","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-bayesian-networks-the-combination-of","title":"Learning Bayesian Networks: The Combination of Knowledge and Statistical Data","date":"2013-02-27","arxiv_id":"1302.6815","repositories_listed":0,"syntology":null},{"url":null,"slug":"interactive-ant-colony-optimisation-iaco-for","title":"Interactive Ant Colony Optimisation (iACO) for Early Lifecycle Software Design","date":"2012-12-21","arxiv_id":"1212.5461","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-polynomial-time-approximation-scheme-for-a","title":"A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm","date":"2012-02-08","arxiv_id":"1202.1708","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-in-real-time-search-a-unifying","title":"Learning in Real-Time Search: A Unifying Framework","date":"2011-09-26","arxiv_id":"1110.4076","repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretical-analysis-of-heuristic-search","title":"Theoretical Analysis of Heuristic Search Methods for Online POMDPs","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"deaf033bdb1203ec59773b9982bf6263a4c1a9c8334a8ae843103826972b5ffe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}