Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,042,289 papers from all fields of science
Search
Sign In
Create Free Account
Heuristic (computer science)
Known as:
Heuristic algorithm
, Heuristic (function)
, Heuristic (disambiguation)
Expand
In computer science, artificial intelligence, and mathematical optimization, a heuristic is a technique designed for solving a problem more quickly…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
15 puzzle
360安全卫士 (360 Safeguard)
ACM Turing Award
Admissible heuristic
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
A New Local Search Algorithm for the DNA Fragment Assembly Problem
E. Alba
,
Gabriel Luque
EvoCOP
2007
Corpus ID: 30638729
In this paper we propose and study the behavior of a new heuristic algorithm for the DNA fragment assembly problem: PALS. The DNA…
Expand
Highly Cited
2003
Highly Cited
2003
Region proximity in metric spaces and its use for approximate similarity search
Giuseppe Amato
,
F. Rabitti
,
P. Savino
,
P. Zezula
TOIS
2003
Corpus ID: 13100819
Similarity search structures for metric data typically bound object partitions by ball regions. Since regions can overlap, a…
Expand
Highly Cited
2003
Highly Cited
2003
OFFSS: optimal fuzzy-valued feature subset selection
Eric C. C. Tsang
,
D. Yeung
,
Xizhao Wang
IEEE transactions on fuzzy systems
2003
Corpus ID: 12742436
Feature subset selection is a well-known pattern recognition problem, which aims to reduce the number of features used in…
Expand
Highly Cited
2000
Highly Cited
2000
Improving the Up ∗ /Down ∗ Routing Scheme for Networks of Workstations (cid:1)
J. Sancho
,
A. Robles
2000
Corpus ID: 27872345
. Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers. Many NOWs are…
Expand
Highly Cited
1991
Highly Cited
1991
Performance trade-offs in a parallel test generation/fault simulation environment
S. Patil
,
P. Banerjee
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1991
Corpus ID: 22299239
Heuristics are proposed to partition faults for parallel test generation with minimization of both the overall run time and test…
Expand
1986
1986
Towards a Theory of Software Protection
Oded Goldreich
Annual International Cryptology Conference
1986
Corpus ID: 41242697
Software protection is one of the most important issues concerning computer practice. The problem is to sell programs that can be…
Expand
Highly Cited
1983
Highly Cited
1983
The GIST Behavior Explainer
W. Swartout
AAAI Conference on Artificial Intelligence
1983
Corpus ID: 6292059
One difficulty in understanding formal specifications is that there are often interactions between pieces of the specification…
Expand
Highly Cited
1978
Highly Cited
1978
The argos image understanding system.
S. Rubin
1978
Corpus ID: 60526133
Abstract : ARGOS is an image understanding system. It builds a three-dimensional model of the task domain and uses hypothesized…
Expand
Highly Cited
1977
Highly Cited
1977
A Model for Learning Systems
Reid G. Smith
,
Tom Michael Mitchell
,
R. Chestek
,
B. Buchanan
International Joint Conference on Artificial…
1977
Corpus ID: 16344666
A model for learning systems is presented, and representative AI, pattern recognition, and control systems are discussed in terms…
Expand
1973
1973
An Algorithm for Determining the Chromatic Number of a Graph
D. Corneil
,
B. P. Graham
SIAM journal on computing (Print)
1973
Corpus ID: 33820815
A heuristic algorithm for the determination of the chromatic number of a finite graph is presented. This algorithm is based on…
Expand