Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
15 puzzle360安全卫士 (360 Safeguard)ACM Turing AwardAdmissible heuristic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
A simulated annealing algorithm for manufacturing cell formation problems
Highly Cited
2008
Highly Cited
2008
Query execution in column-oriented database systems
There are two obvious ways to map a two-dimension relational database table onto a one-dimensional storage interface: store the… 
Highly Cited
2007
Highly Cited
2007
Bandwidth-Efficient Geographic Multicast Routing Protocol for Wireless Sensor Networks
We present geographic multicast routing (GMR), a new multicast routing protocol for wireless sensor networks. It is a fully… 
Highly Cited
2007
Highly Cited
2007
Optimal Defense Strategy Against Intentional Attacks
This paper presents a generalized model of damage caused to a complex multi-state series-parallel system by intentional attack… 
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
We focus our attention on the problem of sequencing jobs in a permutation flow shop with the objective of minimising the sum of… 
Highly Cited
2002
Highly Cited
2002
Distributed partial information management (DPIM) schemes for survivable networks .1
  • C. QiaoDahai Xu
  • Proceedings.Twenty-First Annual Joint Conference…
  • 2002
  • Corpus ID: 2173898
This paper describes a novel framework, called distributed partial information management (or DPIM). It addresses several major… 
Highly Cited
2002
Highly Cited
2002
Fault management in IP-over-WDM networks: WDM protection versus IP restoration
We consider an IP-over-WDM network in which network nodes employ optical crossconnects and IP routers. Nodes are connected by… 
Highly Cited
1996
Highly Cited
1996
A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks
We consider the problem of routing and assignment of wavelength (RAW) in optical networks. Given a set of requests for all… 
Highly Cited
1976
Highly Cited
1976
Optimal allocation of resources in distributed information networks
The problems of file allocation and capacity assignment in a fixed topology distributed computer network are examined. These two… 
Highly Cited
1966
Highly Cited
1966
Heuristics in Job Shop Scheduling
The problem is that of scheduling jobs with diverse routings on the productive facilities in a shop such that the respective due… 
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)