In computer science, artificial intelligence, and mathematical optimization, a heuristic is a technique designed for solving a problem more quickly… (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2011

Highly Cited

2011

- Sean R. Eddy
- PLoS Computational Biology
- 2011

Profile hidden Markov models (profile HMMs) and probabilistic inference methods have made important contributions to the theory… (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Cédric Févotte, Jérôme Idier
- Neural Computation
- 2011

This letter describes algorithms for nonnegative matrix factorization (NMF) with the β-divergence (β-NMF). The β-divergence is a… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- H David Campbell, Richard A. Dudek, Milton L. Smith, Teeh Univeraity
- 2007

[9] has pointed out that the researcher must be concemed not only with obtaining an optioofd solution but also with the practical… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Malte Helmert
- J. Artif. Intell. Res.
- 2006

Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Most engineering optimization algorithms are based on numerical linear and nonlinear programming methods that require substantial… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Dr. Zbigniew Michalewicz, Dr. David B. Fogel
- Springer Berlin Heidelberg
- 2000

This book is the only source that provides comprehensive, current, and correct information on problem solving using modern… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Vittorio Maniezzo, Alberto Colorni
- IEEE Trans. Knowl. Data Eng.
- 1999

ÐIn recent years, there has been growing interest in algorithms inspired by the observation of natural phenomena to define… (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Lawrence T. Kou, George Markowsky, Leonard Berman
- Acta Informatica
- 1981

Given an undirected distance graph G=(V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is… (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- S. Lin, Brian W. Kernighan
- Operations Research
- 1973

An Eflective Heuristic Algorithm for the Traveling. THE SYMMETRIC traveling-salesman problem is: Given an n by n symmetric matrix… (More)

Is this relevant?

Highly Cited

1968

Highly Cited

1968

- Peter E. Hart, Nils J. Nilsson, Bertram Raphael
- IEEE Trans. Systems Science and Cybernetics
- 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?