Browse State-of-the-Art › Heuristic Search
Heuristic Search
76 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Heuristic Search is a problem-solving method that uses practical rules or "guides" (heuristics) to find solutions more quickly than exhaustive search, by focusing on the most promising paths first.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Most implemented papers archive 2025-07-28
30 shown of 76 papers with code (261 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
4 Dec 2019 3 repositories listed Syntology ran 1 of 1 samples · 0 unverified · 1 pointer-only (licence)This study aligns the recently proposed Linear Interpretable Model-agnostic Explainer (LIME) and Shapley Additive Explanations (SHAP) with the notion of counterfactual explanations, and empirically benchmarks their…
-
25 Jan 2024 2 repositories listedWe experimentally compare our DIDP solvers with commercial MIP and CP solvers (solving MIP and CP models, respectively) on common benchmark instances of eleven combinatorial optimization problem classes.
-
30 Dec 2023 2 repositories listed Syntology ran 3 of 5 samples · 2 unverified · 5 pointer-only (licence)Symbolic regression (SR) aims to discover concise closed-form mathematical equations from data, a task fundamental to scientific discovery.
-
26 Jan 2023 2 repositories listedFirst, the paper introduces a new pointer-based solution space for GP that is independent of the number of classical planning instances in a GP problem and the size of those instances (i.
-
30 Nov 2022 2 repositories listedWe illustrate the accuracy and speed of our new method on a variety of simulated scenarios as well as in the estimation of a phylogenetic network for the genus Canis.
-
22 Jun 2020 2 repositories listedMachine learning is becoming increasingly important to control the behavior of safety and financially critical components in sophisticated environments, where the inability to understand learned components in general,…
-
5 Aug 2019 2 repositories listed2D path planning in static environment is a well-known problem and one of the common ways to solve it is to 1) represent the environment as a grid and 2) perform a heuristic search for a path on it.
-
21 Jun 2019 2 repositories listedSequential decision problems in applications such as manipulation in warehouses, multi-step meal preparation, and routing in autonomous vehicle networks often involve reasoning about uncertainty, planning over discrete…
-
22 Mar 2025 1 repository listedFuture research should focus on interpretability, integration with domain-specific solvers, and improving the robustness of AI-driven decision-making.
-
17 Feb 2025 1 repository listed Syntology ran 4 of 4 samples · 0 unverified · 4 pointer-only (licence)Text-to-SQL (Text2SQL) aims to map natural language questions to executable SQL queries.
-
31 Jan 2025 1 repository listed Syntology ran 2 of 8 samples · 6 unverifiedMoreover, it employs MCTS, a heuristic search method driven by policy and reward models, to balance agentic exploration's performance and search space.
-
30 Dec 2024 1 repository listedParallelization and External Memory (PEM) techniques have significantly enhanced the capabilities of search algorithms when solving large-scale problems.
-
28 Dec 2024 1 repository listedWhile safety-aligned large language models (LLMs) are increasingly used as the cornerstone for powerful systems such as multi-agent frameworks to solve complex real-world problems, they still suffer from potential…
-
19 Dec 2024 1 repository listed Syntology ran 2 of 9 samples · 7 unverifiedWhile previous LLM-EPS studies obtained great performance on various tasks, there is still a gap in understanding the properties of heuristic search spaces and achieving a balance between exploration and exploitation,…
-
21 Oct 2024 1 repository listed Syntology ran 5 of 10 samples · 5 unverified · 10 pointer-only (licence)Benefiting from its heuristic search design, SAM2Long is robust toward occlusions and object reappearances, and can effectively segment and track objects for complex long-term videos.
-
14 Sep 2024 1 repository listedWhile model-based reinforcement learning methods learn world models that can then be used for planning, such approaches are limited by errors that accumulate when the model is applied across many timesteps as well as…
-
20 Jul 2024 1 repository listedMulti-agent reinforcement learning (MARL) has recently excelled in solving challenging cooperative and competitive multi-agent problems in various environments, typically involving a small number of agents and full…
-
16 Jul 2024 1 repository listedIn this paper, we introduce the Pareto local search method PALSS with heuristic search operations to solve the multi-objective optimization problem of a residential area with different types of flexible loads.
-
13 Jul 2024 1 repository listedCombining Large Language Models (LLMs) with heuristic search algorithms like A* holds the promise of enhanced LLM reasoning and scalable inference.
-
20 Jun 2024 1 repository listed Syntology ran 6 of 6 samples · 0 unverifiedPath planning is a fundamental scientific problem in robotics and autonomous navigation, requiring the derivation of efficient routes from starting to destination points while avoiding obstacles.
-
15 Jun 2024 1 repository listed Syntology ran 9 of 12 samples · 3 unverified · 12 pointer-only (licence)While various layer pruning methods have been developed based on this insight, they generally overlook the finer-grained redundancies within the layers themselves.
-
7 Jun 2024 1 repository listedWe demonstrate the effectiveness of our approach evaluating it as a standalone search method and in conjunction with learned heuristic functions, achieving comparable-or-better node expansion metrics, while lowering the…
-
5 Jun 2024 1 repository listedPartially Observable Markov Decision Processes (POMDPs) are powerful models for sequential decision making under transition and observation uncertainties.
-
3 Jun 2024 1 repository listedFurther, we propose a novel Satisfiability Modulo Theories (SMT) formulation of subgroup discovery as a white-box optimization problem, which allows solver-based search for subgroups and is open to a variety of…
-
1 Jun 2024 1 repository listedMinecraft is a widely popular video game renowned for its intricate environment.
-
24 May 2024 1 repository listed Syntology ran 7 of 12 samples · 5 unverifiedFederated learning works by aggregating locally computed gradients from multiple clients, thus enabling collaborative training without sharing private client data.
-
15 Feb 2024 1 repository listed Syntology ran 5 of 7 samples · 2 unverified · 7 pointer-only (licence)The discovery of new catalysts is essential for the design of new and more efficient chemical processes in order to transition to a sustainable future.
-
3 Jan 2024 1 repository listedHowever, existing approaches for decision-making in NSMDPs have two major shortcomings: first, they assume that the updated environmental dynamics at the current time are known (although future dynamics can change); and…
-
20 Dec 2023 1 repository listedQuantization replaces floating point arithmetic with integer arithmetic in deep neural network models, providing more efficient on-device inference with less power and memory.
-
19 Dec 2023 1 repository listedIn this paper, we propose a new algorithm, rectangle search, that is instead based on beam search, a variant of breadth-first search.
Syntology lines on 10 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections