Search problem

In computational complexity theory and computability theory, a search problem is a type of computational problem represented by a binary relation. If… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2017
05010019662017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
A lot of research in graph mining has been devoted in the discovery of communities. Most of the work has focused in the scenario… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We describe how to convert the heuristic search algorithm A* into an anytime algorithm that finds a sequence of improved… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Web services are loosely coupled software components, published, located, and invoked across the web. The growing number of web… (More)
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls and QoS routing… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper develops a framework for optimizing global-local hybrids of search or optimization procedures. The paper starts by… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We describe how techniques that were originally developed in statistical mechanics can be applied to search problems that arise… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
that is used by searchers of varying backgrounds a more intelligent and proactive search aid is needed. The problems of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We show that all algorithms that search for an extremum of a cost function perform exactly the same when averaged over all… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
This paper presents a stereo matching algorithm using the dynamic programming technique. The stereo matching problem, that is… (More)
  • figure 2-1
  • figure 2-2
  • figure 3-1
  • figure 3-2
  • figure 3-3
Is this relevant?