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 201–250 of 261 papers

TitleStatusHype
A Neural Architecture Search based Framework for Liquid State Machine Design—0
A Novel Sleep Stage Classification Using CNN Generated by an Efficient Neural Architecture Search with a New Data Processing Trick—0
A One-Class Support Vector Machine Calibration Method for Time Series Change Point Detection—0
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm—0
Approximating Permutations with Neural Network Components for Travelling Photographer Problem—0
Simulation-Assisted Optimization for Large-Scale Evacuation Planning with Congestion-Dependent Delays—0
Asynchronously Trained Distributed Topographic Maps—0
Automatic Deduction Path Learning via Reinforcement Learning with Environmental Correction—0
Automatic Generation of Atomic Consistency Preserving Search Operators for Search-Based Model Engineering—0
Automatic Prompt Optimization via Heuristic Search: A Survey—0
AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Rates—0
Avoiding and Escaping Depressions in Real-Time Heuristic Search—0
Bayesian Decision Trees via Tractable Priors and Probabilistic Context-Free Grammars—0
Beam Search: Faster and Monotonic—0
Best-First Heuristic Search for Multicore Machines—0
Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?—0
Buffer-aware Wireless Scheduling based on Deep Reinforcement Learning—0
Can Large Language Models Play Games? A Case Study of A Self-Play Approach—0
Cascading A*: a Parallel Approach to Approximate Heuristic Search—0
Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding—0
ChemoVerse: Manifold traversal of latent spaces for novel molecule discovery—0
COLIN: Planning with Continuous Linear Numeric Change—0
Combining Deep Learning and Qualitative Spatial Reasoning to Learn Complex Structures from Sparse Examples with Noise—0
Compiler-Level Matrix Multiplication Optimization for Deep Learning—0
Computing Programs for Generalized Planning as Heuristic Search—0
Consistency-based Abductive Reasoning over Perceptual Errors of Multiple Pre-trained Models in Novel Environments—0
Consolidating LAMA with Best-First Width Search—0
Deep Memory Search: A Metaheuristic Approach for Optimizing Heuristic Search—0
Defeasible Decisions: What the Proposal is and isn't—0
Dense Crowd Flow-Informed Path Planning—0
Diffusion-based Reinforcement Learning for Dynamic UAV-assisted Vehicle Twins Migration in Vehicular Metaverses—0
Digital Twin Virtualization with Machine Learning for IoT and Beyond 5G Networks: Research Directions for Security and Optimal Control—0
Direct Policy Gradients: Direct Optimization of Policies in Discrete Action Spaces—0
Distributed Mission Planning of Complex Tasks for Heterogeneous Multi-Robot Teams—0
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies—0
Dynamic Importance Sampling for Anytime Bounds of the Partition Function—0
Dynamic User Pairing for Non-Orthogonal Multiple Access in Downlink Networks—0
Ecological landscapes guide the assembly of optimal microbial communities—0
Efficient Multivariate Bandit Algorithm with Path Planning—0
Efficient Reinforcement Learning with Large Language Model Priors—0
Encoder-Decoder Model for Suffix Prediction in Predictive Monitoring—0
Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks—0
Experience-Based Heuristic Search: Robust Motion Planning with Deep Q-Learning—0
Exponential-Binary State-Space Search—0
Exponential Upper Bounds for the Runtime of Randomized Search Heuristics—0
Extending the Multiple Traveling Salesman Problem for Scheduling a Fleet of Drones Performing Monitoring Missions—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
Show:102550
← PrevPage 5 of 6Next →

No leaderboard results yet.