{"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/2","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":2,"pages_in_order":3,"rows_per_page":100,"rows":[101,200],"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","next":"/task/heuristic-search/papers/3","papers":[{"url":null,"slug":"novelty-heuristics-multi-queue-search-and","title":"Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning","date":"2024-04-08","arxiv_id":"2404.05235","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-learnt-local-mapf-policies-with","title":"Improving Learnt Local MAPF Policies with Heuristic Search","date":"2024-03-29","arxiv_id":"2403.20300","repositories_listed":0,"syntology":null},{"url":null,"slug":"policy-space-search-equivalences-improvements","title":"Policy-Space Search: Equivalences, Improvements, and Compression","date":"2024-03-28","arxiv_id":"2403.19883","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-large-language-models-play-games-a-case","title":"Can Large Language Models Play Games? A Case Study of A Self-Play Approach","date":"2024-03-08","arxiv_id":"2403.05632","repositories_listed":0,"syntology":null},{"url":null,"slug":"alphamaplesat-an-mcts-based-cube-and-conquer","title":"AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems","date":"2024-01-24","arxiv_id":"2401.13770","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-task-and-motion-planning-using-object","title":"Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints","date":"2023-12-29","arxiv_id":"2312.17605","repositories_listed":0,"syntology":null},{"url":null,"slug":"planning-for-the-efficient-updating-of-mutual","title":"Planning for the Efficient Updating of Mutual Fund Portfolios","date":"2023-11-27","arxiv_id":"2311.16204","repositories_listed":0,"syntology":null},{"url":null,"slug":"genetic-engineering-algorithm-gea-an","title":"Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems","date":"2023-09-28","arxiv_id":"2309.16413","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristic-search-for-path-finding-with","title":"Heuristic Search for Path Finding with Refuelling","date":"2023-09-19","arxiv_id":"2309.10796","repositories_listed":0,"syntology":null},{"url":null,"slug":"would-life-be-more-interesting-if-i-were-in","title":"\"Would life be more interesting if I were in AI?\" Answering Counterfactuals based on Probabilistic Inductive Logic Programming","date":"2023-08-30","arxiv_id":"2308.15883","repositories_listed":0,"syntology":null},{"url":null,"slug":"saycanpay-heuristic-planning-with-large","title":"SayCanPay: Heuristic Planning with Large Language Models using Learnable Domain Knowledge","date":"2023-08-24","arxiv_id":"2308.12682","repositories_listed":0,"syntology":null},{"url":null,"slug":"monte-carlo-tree-search-for-multi-agent","title":"Monte-Carlo Tree Search for Multi-Agent Pathfinding: Preliminary Results","date":"2023-07-25","arxiv_id":"2307.13453","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-heuristic-search-based-motion","title":"A Multi-Heuristic Search-based Motion Planning for Automated Parking","date":"2023-07-15","arxiv_id":"2307.07857","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-deduction-path-learning-via","title":"Automatic Deduction Path Learning via Reinforcement Learning with Environmental Correction","date":"2023-06-16","arxiv_id":"2306.10083","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-robot-path-planning-combining","title":"Multi-Robot Path Planning Combining Heuristics and Multi-Agent Reinforcement Learning","date":"2023-06-02","arxiv_id":"2306.01270","repositories_listed":0,"syntology":null},{"url":null,"slug":"scale-adaptive-balancing-of-exploration-and","title":"Scale-Adaptive Balancing of Exploration and Exploitation in Classical Planning","date":"2023-05-16","arxiv_id":"2305.09840","repositories_listed":0,"syntology":null},{"url":null,"slug":"opti-code-pro-a-heuristic-search-based","title":"Opti Code Pro: A Heuristic Search-based Approach to Code Refactoring","date":"2023-05-12","arxiv_id":"2305.07594","repositories_listed":0,"syntology":null},{"url":null,"slug":"search-map-search-a-frame-selection-paradigm","title":"Search-Map-Search: A Frame Selection Paradigm for Action Recognition","date":"2023-04-20","arxiv_id":"2304.10316","repositories_listed":0,"syntology":null},{"url":null,"slug":"mema-runtime-framework-minimizing-external","title":"MEMA Runtime Framework: Minimizing External Memory Accesses for TinyML on Microcontrollers","date":"2023-04-12","arxiv_id":"2304.05544","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristic-search-for-physics-based-problems","title":"Heuristic Search For Physics-Based Problems: Angry Birds in PDDL+","date":"2023-03-29","arxiv_id":"2303.16967","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristic-search-for-multi-objective","title":"Heuristic Search for Multi-Objective Probabilistic Planning","date":"2023-03-25","arxiv_id":"2303.14363","repositories_listed":0,"syntology":null},{"url":null,"slug":"beamattack-generating-high-quality-textual","title":"BeamAttack: Generating High-quality Textual Adversarial Examples through Beam Search and Mixed Semantic Spaces","date":"2023-03-09","arxiv_id":"2303.07199","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-decision-trees-via-tractable-priors","title":"Bayesian Decision Trees via Tractable Priors and Probabilistic Context-Free Grammars","date":"2023-02-15","arxiv_id":"2302.07407","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronously-trained-distributed","title":"Asynchronously Trained Distributed Topographic Maps","date":"2023-01-20","arxiv_id":"2301.08379","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-distance-based-deterministic","title":"Statistical Distance Based Deterministic Offspring Selection in SMC Methods","date":"2022-12-23","arxiv_id":"2212.12290","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-incremental-simple-temporal","title":"An Efficient Incremental Simple Temporal Network Data Structure for Temporal Planning","date":"2022-12-14","arxiv_id":"2212.07226","repositories_listed":0,"syntology":null},{"url":null,"slug":"encoder-decoder-model-for-suffix-prediction","title":"Encoder-Decoder Model for Suffix Prediction in Predictive Monitoring","date":"2022-11-29","arxiv_id":"2211.16106","repositories_listed":0,"syntology":null},{"url":null,"slug":"hsvi-can-solve-zero-sum-partially-observable","title":"HSVI can solve zero-sum Partially Observable Stochastic Games","date":"2022-10-26","arxiv_id":"2210.14640","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-settings-for-cryptocurrency-trading","title":"Optimal Settings for Cryptocurrency Trading Pairs","date":"2022-10-20","arxiv_id":"2210.10971","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-networks-for-local-search-and","title":"Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?","date":"2022-09-09","arxiv_id":"2210.12075","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-scalable-data-driven-technique-for-joint","title":"Simulation-Assisted Optimization for Large-Scale Evacuation Planning with Congestion-Dependent Delays","date":"2022-09-04","arxiv_id":"2209.01535","repositories_listed":0,"syntology":null},{"url":null,"slug":"survey-on-evolutionary-deep-learning","title":"Survey on Evolutionary Deep Learning: Principles, Algorithms, Applications and Open Issues","date":"2022-08-23","arxiv_id":"2208.10658","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-blocking-batch-a-technical-report","title":"Non-Blocking Batch A* (Technical Report)","date":"2022-08-15","arxiv_id":"2208.07031","repositories_listed":0,"syntology":null},{"url":null,"slug":"abstract-interpretation-for-generalized","title":"Abstract Interpretation for Generalized Heuristic Search in Model-Based Planning","date":"2022-08-05","arxiv_id":"2208.02938","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-solve-soft-constrained-vehicle","title":"Learning to Solve Soft-Constrained Vehicle Routing Problems with Lagrangian Relaxation","date":"2022-07-20","arxiv_id":"2207.09860","repositories_listed":0,"syntology":null},{"url":null,"slug":"dense-crowd-flow-informed-path-planning","title":"Dense Crowd Flow-Informed Path Planning","date":"2022-06-01","arxiv_id":"2206.00705","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-programs-for-generalized-planning","title":"Computing Programs for Generalized Planning as Heuristic Search","date":"2022-05-12","arxiv_id":"2205.06259","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-up-generalized-planning-as-heuristic","title":"Scaling-up Generalized Planning as Heuristic Search with Landmarks","date":"2022-05-10","arxiv_id":"2205.04850","repositories_listed":0,"syntology":null},{"url":"/paper/approximating-permutations-with-neural","slug":"approximating-permutations-with-neural","title":"Approximating Permutations with Neural Network Components for Travelling Photographer Problem","date":"2022-04-30","arxiv_id":"2205.00242","repositories_listed":0,"syntology":null},{"url":null,"slug":"beam-search-faster-and-monotonic","title":"Beam Search: Faster and Monotonic","date":"2022-04-06","arxiv_id":"2204.02929","repositories_listed":0,"syntology":null},{"url":null,"slug":"digital-twin-virtualization-with-machine","title":"Digital Twin Virtualization with Machine Learning for IoT and Beyond 5G Networks: Research Directions for Security and Optimal Control","date":"2022-04-05","arxiv_id":"2204.01950","repositories_listed":0,"syntology":null},{"url":null,"slug":"symbolic-search-for-optimal-planning-with","title":"Symbolic Search for Optimal Planning with Expressive Extensions","date":"2022-04-01","arxiv_id":"2204.00288","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-study-on-learning-and-improving","title":"An Empirical Study on Learning and Improving the Search Objective for Unsupervised Paraphrasing","date":"2022-03-23","arxiv_id":"2203.12106","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-and-planning","title":"Representation, learning, and planning algorithms for geometric task and motion planning","date":"2022-03-09","arxiv_id":"2203.04605","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristic-search-for-rank-aggregation-with","title":"Heuristic Search for Rank Aggregation with Application to Label Ranking","date":"2022-01-11","arxiv_id":"2201.03893","repositories_listed":0,"syntology":null},{"url":null,"slug":"lonviz-unboxing-the-black-box-of-configurable","title":"Unlocking the Secrets of Software Configuration Landscapes-Ruggedness, Accessibility, Escapability, and Transferability","date":"2022-01-05","arxiv_id":"2201.01429","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristic-search-planning-with-deep-neural","title":"Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning","date":"2021-12-03","arxiv_id":"2112.01918","repositories_listed":0,"syntology":null},{"url":null,"slug":"dpll-mapf-an-integration-of-multi-agent-path","title":"DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies","date":"2021-11-11","arxiv_id":"2111.06494","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-sleep-stage-classification-using-cnn","title":"A Novel Sleep Stage Classification Using CNN Generated by an Efficient Neural Architecture Search with a New Data Processing Trick","date":"2021-10-27","arxiv_id":"2110.15277","repositories_listed":0,"syntology":null},{"url":null,"slug":"hsvi-fo-zs-posgs-using-concavity-convexity","title":"HSVI for zs-POSGs using Concavity, Convexity and Lipschitz Properties","date":"2021-10-25","arxiv_id":"2110.14529","repositories_listed":0,"syntology":null},{"url":null,"slug":"ecological-landscapes-guide-the-assembly-of","title":"Ecological landscapes guide the assembly of optimal microbial communities","date":"2021-10-21","arxiv_id":"2110.11310","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-mission-planning-of-complex-tasks","title":"Distributed Mission Planning of Complex Tasks for Heterogeneous Multi-Robot Teams","date":"2021-09-21","arxiv_id":"2109.10106","repositories_listed":0,"syntology":null},{"url":null,"slug":"searching-for-more-efficient-dynamic-programs","title":"Searching for More Efficient Dynamic Programs","date":"2021-09-14","arxiv_id":"2109.06966","repositories_listed":0,"syntology":null},{"url":null,"slug":"voxel-selection-framework-based-on-meta","title":"Voxel selection framework based on meta-heuristic search and mutual information for brain decoding","date":"2021-07-29","arxiv_id":"2109.02486","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-meta-heuristic-search-algorithm-based-on","title":"A Meta-Heuristic Search Algorithm based on Infrasonic Mating Displays in Peafowls","date":"2021-06-28","arxiv_id":"2106.14487","repositories_listed":0,"syntology":null},{"url":null,"slug":"masai-multi-agent-summative-assessment","title":"MASAI: Multi-agent Summative Assessment Improvement for Unsupervised Environment Design","date":"2021-06-13","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-planning-as-heuristic-search","title":"Generalized Planning as Heuristic Search","date":"2021-03-26","arxiv_id":"2103.14434","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bfhs-a-hybrid-heuristic-search-algorithm","title":"A*+BFHS: A Hybrid Heuristic Search Algorithm","date":"2021-03-23","arxiv_id":"2103.12701","repositories_listed":0,"syntology":null},{"url":null,"slug":"experience-based-heuristic-search-robust","title":"Experience-Based Heuristic Search: Robust Motion Planning with Deep Q-Learning","date":"2021-02-05","arxiv_id":"2102.03127","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-policies-for-software-defined-mdps","title":"Universal Policies for Software-Defined MDPs","date":"2020-12-21","arxiv_id":"2012.11401","repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-limited-model-based-diagnosis","title":"RBF-HS: Recursive Best-First Hitting Set Search","date":"2020-10-08","arxiv_id":"2010.04282","repositories_listed":0,"syntology":null},{"url":null,"slug":"goal-directed-generation-of-discrete","title":"Goal-directed Generation of Discrete Structures with Conditional Generative Models","date":"2020-10-05","arxiv_id":"2010.02311","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-heuristic-search-for-module","title":"Graph-based Heuristic Search for Module Selection Procedure in Neural Module Network","date":"2020-09-30","arxiv_id":"2009.14759","repositories_listed":0,"syntology":null},{"url":null,"slug":"chemoverse-manifold-traversal-of-latent","title":"ChemoVerse: Manifold traversal of latent spaces for novel molecule discovery","date":"2020-09-29","arxiv_id":"2009.13946","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-goal-multi-agent-path-finding-via","title":"Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering","date":"2020-09-10","arxiv_id":"2009.05161","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-english-free-association-network","title":"Analysis of English free association network reveals mechanisms of efficient solution of Remote Association Tests","date":"2020-08-27","arxiv_id":"2008.12219","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shots-parameter-tuning-via-co-evolution","title":"Few-shots Parallel Algorithm Portfolio Construction via Co-evolution","date":"2020-07-01","arxiv_id":"2007.00501","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-bellman-s-optimality-principle-for-zs","title":"On Bellman's Optimality Principle for zs-POSGs","date":"2020-06-29","arxiv_id":"2006.16395","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-user-pairing-for-non-orthogonal","title":"Dynamic User Pairing for Non-Orthogonal Multiple Access in Downlink Networks","date":"2020-06-25","arxiv_id":"2006.14297","repositories_listed":0,"syntology":null},{"url":null,"slug":"extending-the-multiple-traveling-salesman","title":"Extending the Multiple Traveling Salesman Problem for Scheduling a Fleet of Drones Performing Monitoring Missions","date":"2020-06-02","arxiv_id":"2006.01473","repositories_listed":0,"syntology":null},{"url":null,"slug":"reactive-sample-size-for-heuristic-search-in","title":"Reactive Sample Size for Heuristic Search in Simulation-based Optimization","date":"2020-05-25","arxiv_id":"2005.12141","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-accelerate-heuristic-searching","title":"Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising","date":"2020-05-09","arxiv_id":"2005.04355","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-neural-symbolic-descriptive-planning","title":"Learning Neural-Symbolic Descriptive Planning Models via Cube-Space Priors: The Voyage Home (to STRIPS)","date":"2020-04-27","arxiv_id":"2004.12850","repositories_listed":0,"syntology":null},{"url":null,"slug":"gbeam-aco-a-greedy-and-faster-variant-of-beam","title":"gBeam-ACO: a greedy and faster variant of Beam-ACO","date":"2020-04-23","arxiv_id":"2004.11137","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-resolution-a","title":"Multi-Resolution A*","date":"2020-04-14","arxiv_id":"2004.06684","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-upper-bounds-for-the-runtime-of","title":"Exponential Upper Bounds for the Runtime of Randomized Search Heuristics","date":"2020-04-13","arxiv_id":"2004.05733","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neural-architecture-search-based-framework","title":"A Neural Architecture Search based Framework for Liquid State Machine Design","date":"2020-04-07","arxiv_id":"2004.07864","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-analysis-and-optimization-in","title":"User-Level Privacy-Preserving Federated Learning: Analysis and Performance Optimization","date":"2020-02-29","arxiv_id":"2003.00229","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-detection-of-maximum-common-subgraph-via","title":"GLSearch: Maximum Common Subgraph Detection via Learning to Search","date":"2020-02-08","arxiv_id":"2002.03129","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-bias-driven-reinforcement-learning-1","title":"Inductive Bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimally-solving-two-agent-decentralized","title":"Optimally Solving Two-Agent Decentralized POMDPs Under One-Sided Information Sharing","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimally-solving-two-agent-decentralized-1","title":"Optimally Solving Two-Agent Decentralized POMDPs Under One-Sided Information Sharing","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-dynamic-structures-with-bayesian","title":"Optimizing Dynamic Structures with Bayesian Generative Search","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-search-algorithm-for-the-game-of-bridge","title":"The αμ Search Algorithm for the Game of Bridge","date":"2019-11-18","arxiv_id":"1911.07960","repositories_listed":0,"syntology":null},{"url":null,"slug":"buffer-aware-wireless-scheduling-based-on","title":"Buffer-aware Wireless Scheduling based on Deep Reinforcement Learning","date":"2019-11-13","arxiv_id":"1911.05281","repositories_listed":0,"syntology":null},{"url":null,"slug":"action-selection-for-mdps-anytime-ao-vs-uct","title":"Action Selection for MDPs: Anytime AO* vs. UCT","date":"2019-09-26","arxiv_id":"1909.12104","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-heuristic-for-efficient-reduction-in-hidden","title":"A Heuristic for Efficient Reduction in Hidden Layer Combinations For Feedforward Neural Networks","date":"2019-09-25","arxiv_id":"1909.12226","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-maximum-common-subgraph-detection-with","title":"Neural Maximum Common Subgraph Detection with Guided Subgraph Extraction","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-planning-with-intermediate","title":"Temporal Planning with Intermediate Conditions and Effects","date":"2019-09-25","arxiv_id":"1909.11581","repositories_listed":0,"syntology":null},{"url":null,"slug":"compiler-level-matrix-multiplication","title":"Compiler-Level Matrix Multiplication Optimization for Deep Learning","date":"2019-09-23","arxiv_id":"1909.10616","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-multivariate-bandit-algorithm-with","title":"Efficient Multivariate Bandit Algorithm with Path Planning","date":"2019-09-06","arxiv_id":"1909.02705","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-bias-driven-reinforcement-learning","title":"Inductive-bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters","date":"2019-09-04","arxiv_id":"1909.02119","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-budgeted-exponential-search","title":"Iterative Budgeted Exponential Search","date":"2019-07-30","arxiv_id":"1907.13062","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-generation-of-atomic-consistency","title":"Automatic Generation of Atomic Consistency Preserving Search Operators for Search-Based Model Engineering","date":"2019-07-12","arxiv_id":"1907.05647","repositories_listed":0,"syntology":null},{"url":null,"slug":"autoslim-an-automatic-dnn-structured-pruning","title":"AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Rates","date":"2019-07-06","arxiv_id":"1907.03141","repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-policy-gradients-direct-optimization","title":"Direct Policy Gradients: Direct Optimization of Policies in Discrete Action Spaces","date":"2019-06-14","arxiv_id":"1906.06062","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-binary-state-space-search","title":"Exponential-Binary State-Space Search","date":"2019-06-07","arxiv_id":"1906.02912","repositories_listed":0,"syntology":null},{"url":null,"slug":"zooming-cautiously-linear-memory-heuristic","title":"Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees","date":"2019-06-07","arxiv_id":"1906.03242","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-sequential-medical-treatments-with","title":"Optimizing Sequential Medical Treatments with Auto-Encoding Heuristic Search in POMDPs","date":"2019-05-17","arxiv_id":"1905.07465","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-safe-real-time-heuristic-search","title":"Improved Safe Real-time Heuristic Search","date":"2019-05-15","arxiv_id":"1905.06402","repositories_listed":0,"syntology":null}],"record_sha256":"daa7367c0ea2f5aa0864cd709db3ab1b9ff14cc74b4657cbf5a26d187423753a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}