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 61–70 of 261 papers

TitleStatusHype
An Energy-Aware Approach to Design Self-Adaptive AI-based Applications on the EdgeCode0
RetroBridge: Modeling Retrosynthesis with Markov BridgesCode1
"Would life be more interesting if I were in AI?" Answering Counterfactuals based on Probabilistic Inductive Logic Programming—0
SayCanPay: Heuristic Planning with Large Language Models using Learnable Domain Knowledge—0
Monte-Carlo Tree Search for Multi-Agent Pathfinding: Preliminary Results—0
Finding Optimal Diverse Feature Sets with Alternative Feature SelectionCode0
A Multi-Heuristic Search-based Motion Planning for Automated Parking—0
Automatic Deduction Path Learning via Reinforcement Learning with Environmental Correction—0
Multi-Robot Path Planning Combining Heuristics and Multi-Agent Reinforcement Learning—0
Scale-Adaptive Balancing of Exploration and Exploitation in Classical Planning—0
Show:102550
← PrevPage 7 of 27Next →

No leaderboard results yet.