SOTAVerified

Heuristic Search

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.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 101–150 of 261 papers

TitleStatusHype
Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles—0
PERCH: Perception via Search for Multi-Object Recognition and Localization—0
User-Level Privacy-Preserving Federated Learning: Analysis and Performance Optimization—0
Planning for the Efficient Updating of Mutual Fund Portfolios—0
Policy-Space Search: Equivalences, Improvements, and Compression—0
Q*: Improving Multi-step Reasoning for LLMs with Deliberative Planning—0
Reactive Sample Size for Heuristic Search in Simulation-based Optimization—0
Representation, learning, and planning algorithms for geometric task and motion planning—0
HTS-Attack: Heuristic Token Search for Jailbreaking Text-to-Image Models—0
SayCanPay: Heuristic Planning with Large Language Models using Learnable Domain Knowledge—0
Scale-Adaptive Balancing of Exploration and Exploitation in Classical Planning—0
Scaling-up Generalized Planning as Heuristic Search with Landmarks—0
Searching for More Efficient Dynamic Programs—0
Search-Map-Search: A Frame Selection Paradigm for Action Recognition—0
Search-Space Characterization for Real-time Heuristic Search—0
Skip-Thinking: Chunk-wise Chain-of-Thought Distillation Enable Smaller Language Models to Reason Better and Faster—0
Soft Reasoning: Navigating Solution Spaces in Large Language Models through Controlled Embedding Exploration—0
Solving 7x7 Killall-Go with Seki Database—0
Solving Mixed Model Workplace Time-dependent Assembly Line Balancing Problem with FSS Algorithm—0
Statistical Distance Based Deterministic Offspring Selection in SMC Methods—0
Survey on Evolutionary Deep Learning: Principles, Algorithms, Applications and Open Issues—0
Symbolic Search for Optimal Planning with Expressive Extensions—0
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices—0
Temporal Planning with Intermediate Conditions and Effects—0
Testing Deep Neural Networks—0
The Actor Search Tree Critic (ASTC) for Off-Policy POMDP Learning in Medical Decision Making—0
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks—0
The Optimality of Satisficing Solutions—0
Theoretical Analysis of Heuristic Search Methods for Online POMDPs—0
The Partner Units Configuration Problem: Completing the Picture—0
The αμ Search Algorithm for the Game of Bridge—0
Topological Value Iteration Algorithms—0
Toward Efficient Task Assignment and Motion Planning for Large Scale Underwater Mission—0
Transition-Based Syntactic Linearization—0
Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints—0
Universal Policies for Software-Defined MDPs—0
Voxel selection framework based on meta-heuristic search and mutual information for brain decoding—0
Web Search Result Clustering based on Heuristic Search and k-means—0
Windowed MAPF with Completeness Guarantees—0
"Would life be more interesting if I were in AI?" Answering Counterfactuals based on Probabilistic Inductive Logic Programming—0
A*+BFHS: A Hybrid Heuristic Search Algorithm—0
GLSearch: Maximum Common Subgraph Detection via Learning to Search—0
Feature-Based Diversity Optimization for Problem Instance Classification—0
FedMoE: Personalized Federated Learning via Heterogeneous Mixture of Experts—0
Few-shots Parallel Algorithm Portfolio Construction via Co-evolution—0
Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The Best Input Parameters For R* Algorithm Through Series Of Experiments—0
gBeam-ACO: a greedy and faster variant of Beam-ACO—0
Generalized Planning as Heuristic Search—0
Generating Acrostics via Paraphrasing and Heuristic Search—0
Generation of Near-Optimal Solutions Using ILP-Guided Sampling—0
Show:102550
← PrevPage 3 of 6Next →

No leaderboard results yet.