Heuristic (computer science)

Known as: Heuristic algorithm, Heuristic (function), Heuristic (disambiguation) 
In computer science, artificial intelligence, and mathematical optimization, a heuristic is a technique designed for solving a problem more quickly… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2018
020040060019682018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Profile hidden Markov models (profile HMMs) and probabilistic inference methods have made important contributions to the theory… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
This letter describes algorithms for nonnegative matrix factorization (NMF) with the β-divergence (β-NMF). The β-divergence is a… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
[9] has pointed out that the researcher must be concemed not only with obtaining an optioofd solution but also with the practical… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Most engineering optimization algorithms are based on numerical linear and nonlinear programming methods that require substantial… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This book is the only source that provides comprehensive, current, and correct information on problem solving using modern… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
ÐIn recent years, there has been growing interest in algorithms inspired by the observation of natural phenomena to define… (More)
  • table 1
  • figure 1
  • table 2
Is this relevant?
Highly Cited
1981
Highly Cited
1981
Given an undirected distance graph G=(V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is… (More)
  • figure 1
Is this relevant?
Highly Cited
1973
Highly Cited
1973
An Eflective Heuristic Algorithm for the Traveling. THE SYMMETRIC traveling-salesman problem is: Given an n by n symmetric matrix… (More)
Is this relevant?
Highly Cited
1968
Highly Cited
1968
Our paper on the use of heuristic information in graph searching defined a path-finding algorithm, A*, and proved that it had two… (More)
Is this relevant?