Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Search problem

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Software module clustering is the problem of automatically organizing software units into modules to improve program structure… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
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… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper addresses the problem of determining the next set of releases in the course of software evolution. It formulates both… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Search Theory is one of the original disciplines within the field of Operations Research. It deals with the problem faced by a… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Abstract This paper claims that a new field of software engineering research and practice is emerging: search-based software… Expand
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… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Abstract The problem of concept learning, or forming a general description of a class of objects given a set of examples and non… Expand
  • figure 4
  • figure 6
  • table 1
  • figure 12
Is this relevant?
Highly Cited
1981
Highly Cited
1981
A planar subdivision is any partition of the plane into (possibly unbounded) polygonal regions. The subdivision search problem is… Expand
Is this relevant?