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
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
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
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
Highly Cited
2003
Highly Cited
2003
  • Steven Alpern, S. Gal
  • International series in operations research and…
  • 2003
  • Corpus ID: 122425654
Search Theory is one of the original disciplines within the field of Operations Research. It deals with the problem faced by a… Expand
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
Highly Cited
1999
Highly Cited
1999
Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls and QoS routing… Expand
Highly Cited
1986
Highly Cited
1986
The fundamental principles, basic mechanisms, and formal analyses involved in the development of parallel distributed processing… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
Highly Cited
1983
Highly Cited
1983
A planar subdivision is any partition of the plane into (possibly unbounded) polygonal regions. The subdivision search problem is… Expand
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