Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,230,610 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.
2008
2008
Network Coding Based Cooperative Peer-to-Peer Repair in Wireless Ad-Hoc Networks
Xin Liu
,
Saqib Raza
,
Chen-Nee Chuah
,
Gene Cheung
IEEE International Conference on Communications
2008
Corpus ID: 1433529
Cooperative Peer-to-Peer Repair (CPR) has been proposed to recover from packet losses incurred during 3G broadcast. CPR leverages…
Expand
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
2005
2005
Minimum energy accumulative routing in wireless networks
Jiangzhuo Chen
,
L. Jia
,
Xin Liu
,
G. Noubir
,
R. Sundaram
Proceedings IEEE 24th Annual Joint Conference of…
2005
Corpus ID: 9623070
In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay…
Expand
Highly Cited
2004
Highly Cited
2004
Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling
J. M. López
,
J. L. Díaz
,
D. F. García
IEEE Transactions on Parallel and Distributed…
2004
Corpus ID: 825704
The utilization bound for real-time rate monotonic (RM) scheduling on uniprocessors is extended to multiprocessors with…
Expand
Highly Cited
2004
Highly Cited
2004
Stopping Spam by Extrusion Detection
R. Clayton
International Conference on Email and Anti-Spam
2004
Corpus ID: 466275
End users are often unaware that their systems have been compromised and are being used to send bulk unsolicited email (spam). We…
Expand
Highly Cited
1991
Highly Cited
1991
Performance trade-offs in a parallel test generation/fault simulation environment
Srinivas 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
Highly Cited
1990
Highly Cited
1990
Arrangement of latches in scan-path design to improve delay fault coverage
Wei-Wei Mao
,
M. Ciletti
Proceedings. International Test Conference
1990
Corpus ID: 45325948
A problem involving the arrangement of latches in a scan-path design to improve the coverage of delay faults is described. The…
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
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