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

1958-2019
01000200019582018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
We present a unified heuristic, which is able to solve five diff erent variants of the vehicle routing problem: the vehicle… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present a technique for evaluating the usability and effectiveness of ambient displays. Ambient displays are abstract and… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This report discusses the design of computational experiments to test heuristic methods and provides reporting guidelines for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Usability specialists were better than non-specialists at performing heuristic evaluation, and “double experts” with specific… (More)
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
1989
Highly Cited
1989
This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1985
Highly Cited
1985
In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Let N be a finite set and z be a real-valued function defined on the set of subsets of N that satisfies z(S)+z(T)>-z(SUT)+z(SnT… (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?