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 51–60 of 261 papers

TitleStatusHype
Deep Generative Symbolic RegressionCode1
Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints—0
Towards Efficient Verification of Quantized Neural NetworksCode0
Rectangle Search: An Anytime Beam Search (Extended Version)Code0
Planning for the Efficient Updating of Mutual Fund Portfolios—0
CylinderTag: An Accurate and Flexible Marker for Cylinder-Shape Objects Pose Estimation Based on Projective InvariantsCode1
Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and LearningCode1
A More General Theory of Diagnosis from First PrinciplesCode0
Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems—0
Heuristic Search for Path Finding with Refuelling—0
Show:102550
← PrevPage 6 of 27Next →

No leaderboard results yet.