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 151–160 of 261 papers

TitleStatusHype
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
Show:102550
← PrevPage 16 of 27Next →

No leaderboard results yet.