Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,843,839 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
2008
Highly Cited
2008
Clustering strategies for improving the lifetime of two-tiered sensor networks
A. Bari
,
A. Jaekel
,
S. Bandyopadhyay
Computer Communications
2008
Corpus ID: 29149382
Highly Cited
2007
Highly Cited
2007
Fairness-Aware Adaptive Resource Allocation Scheme in Multihop OFDMA Systems
ChiSung Bae
,
D. Cho
IEEE Communications Letters
2007
Corpus ID: 11841053
We investigate a fairness-aware adaptive resource allocation scheme for the downlink of multihop OFDMA systems. Assuming that the…
Expand
Highly Cited
2004
Highly Cited
2004
Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003
J. Framiñán
2004
Corpus ID: 11395472
We focus our attention on the problem of sequencing jobs in a permutation flow shop with the objective of minimising the sum of…
Expand
Highly Cited
2004
Highly Cited
2004
Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling
J. 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
1999
Highly Cited
1999
The dual iteration for fixed-order control
T. Iwasaki
IEEE Transactions on Automatic Control
1999
Corpus ID: 11171194
This paper proposes a new heuristic algorithm for fixed-order control problems using linear matrix inequalities. The authors call…
Expand
Highly Cited
1994
Highly Cited
1994
Techniques For Crosstalk Avoidance In The Physical Design Of High-performance Digital Systems
D. Kirkpatrick
,
A. Sangiovanni-Vincentelli
IEEE/ACM International Conference on Computer…
1994
Corpus ID: 10641485
Interconnect performance does not scale well into deep submicron dimensions, and the rising number of analog effects erodes the…
Expand
Highly Cited
1988
Highly Cited
1988
Control of cognitive processes during software design: what tools are needed?
R. Guindon
,
B. Curtis
International Conference on Human Factors in…
1988
Corpus ID: 17271394
A verbal protocol study of professional software designers has revealed three design process control strategies. At least one of…
Expand
Highly Cited
1984
Highly Cited
1984
Analysis of group technology scheduling heuristics
C. Mosier
,
D. A. Elvers
,
D. Kelly
1984
Corpus ID: 62550326
The need for increased productivity in small batch manufacturing has recently brought focus to the topics and concepts of group…
Expand
Highly Cited
1979
Highly Cited
1979
Fault Analysis and Test Generation for Programmable Logic Arrays (PLA's)
D. Ostapko
,
S. Hong
IEEE transactions on computers
1979
Corpus ID: 157112
Programmable logic arrays (PLA's) are the logic implementation vehicle for many applications. Due to their regular structure, one…
Expand
Highly Cited
1976
Highly Cited
1976
Optimal allocation of resources in distributed information networks
S. Mahmoud
,
J. Riordon
TODS
1976
Corpus ID: 1756309
The problems of file allocation and capacity assignment in a fixed topology distributed computer network are examined. These two…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE