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

Showing 201250 of 261 papers

TitleStatusHype
Mean-based Heuristic Search for Real-Time Planning0
Discovering Reliable Dependencies from Data: Hardness and Improved AlgorithmsCode0
Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles0
The Actor Search Tree Critic (ASTC) for Off-Policy POMDP Learning in Medical Decision Making0
Heuristics for vehicle routing problems: Sequence or set optimization?0
Testing Deep Neural Networks0
DeepType: Multilingual Entity Linking by Neural Type System EvolutionCode0
Get Your Workload in Order: Game Theoretic Prioritization of Database Auditing0
A Heuristic Search Algorithm Using the Stability of Learning Algorithms in Certain Scenarios as the Fitness Function: An Artificial General Intelligence Engineering Approach0
Dynamic Importance Sampling for Anytime Bounds of the Partition Function0
Heuristic Search for Structural Constraints in Data Association0
Evolving Deep Convolutional Neural Networks for Image ClassificationCode0
On the Discrimination Power and Effective Utilization of Active Learning Measures in Version Space Search0
Solving Mixed Model Workplace Time-dependent Assembly Line Balancing Problem with FSS Algorithm0
Learning Heuristic Search via ImitationCode1
Neural Machine Translation with Gumbel-Greedy Decoding0
A Formal Characterization of the Local Search Topology of the Gap Heuristic0
Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains0
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node ExpansionsCode0
Generation of Near-Optimal Solutions Using ILP-Guided Sampling0
Toward Efficient Task Assignment and Motion Planning for Large Scale Underwater Mission0
Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The Best Input Parameters For R* Algorithm Through Series Of Experiments0
Feature-Based Diversity Optimization for Problem Instance Classification0
PERCH: Perception via Search for Multi-Object Recognition and Localization0
Web Search Result Clustering based on Heuristic Search and k-means0
On the Linear Belief Compression of POMDPs: A re-examination of current methods0
An Efficient Genetic Algorithm for Discovering Diverse-Frequent Patterns0
Grid-based angle-constrained path planning0
Transition-Based Syntactic Linearization0
Influence-Optimistic Local Values for Multiagent Planning --- Extended Version0
Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?0
A Heuristic Search Algorithm for Solving First-Order MDPs0
Generating Acrostics via Paraphrasing and Heuristic Search0
Cascading A*: a Parallel Approach to Approximate Heuristic Search0
Local Optima Networks: A New Model of Combinatorial Fitness Landscapes0
Homotopy based algorithms for _0-regularized least-squares0
COLIN: Planning with Continuous Linear Numeric Change0
Avoiding and Escaping Depressions in Real-Time Heuristic Search0
On-line Planning and Scheduling: An Application to Controlling Modular Printers0
Best-First Heuristic Search for Multicore Machines0
Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding0
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks0
Topological Value Iteration Algorithms0
Implicit Abstraction Heuristics0
Online Planning Algorithms for POMDPs0
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains0
Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks0
On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection0
The Partner Units Configuration Problem: Completing the Picture0
Search-Space Characterization for Real-time Heuristic Search0
Show:102550
← PrevPage 5 of 6Next →

No leaderboard results yet.