Skip to search formSkip to main contentSkip to account menu

Search problem

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2010
Review
2010
This half-day tutorial introduces participants to data-intensive text processing with the MapReduce programming model [1], using… 
Highly Cited
2009
Highly Cited
2009
Proteins seek out binding sites on DNA through diffusion and also by sliding along the strand. Although ‘roadblocks’—other bound… 
Highly Cited
2005
Highly Cited
2005
Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense… 
Highly Cited
2002
Highly Cited
2002
Whenever robots are installed in populated environments, they need appropriate techniques to avoid collisions with unexpected… 
Highly Cited
1999
Highly Cited
1999
This paper presents advances in the construction and use of Active Appearance Models (AAMs) for image interpretation. AAMs are… 
Highly Cited
1993
Highly Cited
1993
  • N. Jennings
  • 1993
  • Corpus ID: 5853270
Abstract Distributed Artificial Intelligence systems, in which multiple agents interact to improve their individual performance…