In applied mathematics and computer science, a local optimum of an optimization problem is a solution that is optimal (either maximal or minimal… (More)

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

Highly Cited

2006

Highly Cited

2006

- Philip A. Chou, Zhourong Miao
- IEEE Transactions on Multimedia
- 2006

This paper addresses the problem of streaming packetized media over a lossy packet network in a rate-distortion optimized way. We… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Michel Verleysen
- 2002

The visual interpretation of data is an essential step to guide any further processing or decision making. Dimensionality… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

One common characterization of how simple hill climbing optimization methods can fail is that they become trapped in local op… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Xin Yao, Yong Liu, Guangming Lin
- IEEE Trans. Evolutionary Computation
- 1999

Evolutionary programming (EP) has been applied with success to many numerical and combinatorial optimization problems in recent… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Roberto J. Bayardo, Robert Schrag
- AAAI/IAAI
- 1997

We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Bernd Freisleben, Peter Merz
- International Conference on Evolutionary…
- 1996

| The combination of local search heuristics and genetic algorithms is a promising approach for nding near-optimum solutions to… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Zhengyou Zhang, Rachid Deriche, Olivier D. Faugeras, Quang-Tuan Luong
- Artif. Intell.
- 1995

This paper proposes a robust approach to image matching by exploiting the only available geometric constraint, namely, the… (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Bart Selman, Henry A. Kautz, Bram Cohen
- AAAI
- 1994

It has recently been shown that local search is sur prisingly good at nding satisfying assignments for certain computationally… (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Jérôme Barraquand, Bruno Langlois, Jean-Claude Latombe
- Fifth International Conference on Advanced…
- 1991

The authors investigate a path planning approach that consists of concurrently building and searching a graph connecting the… (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
- 26th Annual Symposium on Foundations of Computer…
- 1985

One of the few general approaches to difficult combinatorial optimization problems that has met with empirical success is local… (More)

Is this relevant?