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

TitleStatusHype
Mean-based Heuristic Search for Real-Time Planning—0
Discovering Reliable Dependencies from Data: Hardness and Improved AlgorithmsCode0
Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles—0
The Actor Search Tree Critic (ASTC) for Off-Policy POMDP Learning in Medical Decision Making—0
Heuristics for vehicle routing problems: Sequence or set optimization?—0
Testing Deep Neural Networks—0
DeepType: Multilingual Entity Linking by Neural Type System EvolutionCode0
Get Your Workload in Order: Game Theoretic Prioritization of Database Auditing—0
A Heuristic Search Algorithm Using the Stability of Learning Algorithms in Certain Scenarios as the Fitness Function: An Artificial General Intelligence Engineering Approach—0
Dynamic Importance Sampling for Anytime Bounds of the Partition Function—0
Heuristic Search for Structural Constraints in Data Association—0
Evolving Deep Convolutional Neural Networks for Image ClassificationCode0
On the Discrimination Power and Effective Utilization of Active Learning Measures in Version Space Search—0
Solving Mixed Model Workplace Time-dependent Assembly Line Balancing Problem with FSS Algorithm—0
Learning Heuristic Search via ImitationCode1
Neural Machine Translation with Gumbel-Greedy Decoding—0
A Formal Characterization of the Local Search Topology of the Gap Heuristic—0
Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains—0
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node ExpansionsCode0
Generation of Near-Optimal Solutions Using ILP-Guided Sampling—0
Toward Efficient Task Assignment and Motion Planning for Large Scale Underwater Mission—0
Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The Best Input Parameters For R* Algorithm Through Series Of Experiments—0
Feature-Based Diversity Optimization for Problem Instance Classification—0
PERCH: Perception via Search for Multi-Object Recognition and Localization—0
Web Search Result Clustering based on Heuristic Search and k-means—0
On the Linear Belief Compression of POMDPs: A re-examination of current methods—0
An Efficient Genetic Algorithm for Discovering Diverse-Frequent Patterns—0
Grid-based angle-constrained path planning—0
Transition-Based Syntactic Linearization—0
Influence-Optimistic Local Values for Multiagent Planning --- Extended Version—0
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 MDPs—0
Generating Acrostics via Paraphrasing and Heuristic Search—0
Cascading A*: a Parallel Approach to Approximate Heuristic Search—0
Local Optima Networks: A New Model of Combinatorial Fitness Landscapes—0
Homotopy based algorithms for _0-regularized least-squares—0
COLIN: Planning with Continuous Linear Numeric Change—0
Avoiding and Escaping Depressions in Real-Time Heuristic Search—0
On-line Planning and Scheduling: An Application to Controlling Modular Printers—0
Best-First Heuristic Search for Multicore Machines—0
Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding—0
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks—0
Topological Value Iteration Algorithms—0
Implicit Abstraction Heuristics—0
Online Planning Algorithms for POMDPs—0
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains—0
Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks—0
On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection—0
The Partner Units Configuration Problem: Completing the Picture—0
Search-Space Characterization for Real-time Heuristic Search—0
Show:102550
← PrevPage 5 of 6Next →

No leaderboard results yet.