Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,257,084 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Algorithm
Clique (graph theory)
Computability
Computability theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
An Efficient Framework for Exact Set Similarity Search Using Tree Structure Indexes
Yong Zhang
,
Xiuxing Li
,
Jin Wang
,
Ying Zhang
,
Chunxiao Xing
,
Xiaojie Yuan
IEEE International Conference on Data Engineering
2017
Corpus ID: 1366197
Similarity search is an essential operation in many applications. Given a collection of set records and a query, the exact set…
Expand
2016
2016
Resource Optimization-Based Interference Management for Hybrid Self-Organized Small-Cell Network
Heli Zhang
,
Yongbin Wang
,
Hong Ji
IEEE Transactions on Vehicular Technology
2016
Corpus ID: 39345161
This paper jointly studies interference management (IM) and self-organization (SO) schemes in a hybrid-SO small-cell network…
Expand
Highly Cited
2013
Highly Cited
2013
An Efficient Tag Search Protocol in Large-Scale RFID Systems With Noisy Channel
Min Chen
,
Wen Luo
,
Zhen Mo
,
Shigang Chen
,
Yuguang Fang
IEEE/ACM Transactions on Networking
2013
Corpus ID: 1220220
Radio frequency identification (RFID) technology has many applications in inventory management, supply chain, product tracking…
Expand
2011
2011
An efficient mechanism for processing similarity search queries in sensor networks
Yu-Chi Chung
,
I-Fang Su
,
Chiang Lee
Information Sciences
2011
Corpus ID: 1569794
2008
2008
Network search games with immobile hider, without a designated searcher starting point
S. Alpern
,
V. Baston
,
S. Gal
International Journal of Game Theory
2008
Corpus ID: 14285276
In the (zero-sum) search game Γ(G, x) proposed by Isaacs, the Hider picks a point H in the network G and the Searcher picks a…
Expand
2006
2006
Optimization of Cost Functions Using Evolutionary Algorithms With Local Learning and Local Search
Frederico G. Guimarães
,
F. Campelo
,
Hajime Igarashi
,
D. Lowther
,
Jaime A. Ramírez
IEEE transactions on magnetics
2006
Corpus ID: 22453998
Evolutionary algorithms can benefit from their association with local search operators, giving rise to hybrid or memetic…
Expand
1989
1989
Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry
F. Dehne
,
A. Rau-Chaplin
J. Parallel Distributed Comput.
1989
Corpus ID: 14627758
1985
1985
Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane
H. Edelsbrunner
,
H. Maurer
Information Processing Letters
1985
Corpus ID: 6801884
1984
1984
Logic-Based Formula Management Strategies in an Actuarial Consulting System
T. Sivasankaran
,
M. Jarke
Decision Support Systems
1984
Corpus ID: 12300255
Review
1981
Review
1981
Modelling Student's Problem Solving
D. Sleeman
,
M. Smith
Artificial Intelligence
1981
Corpus ID: 9599432
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE