Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,060,978 papers from all fields of science
Search
Sign In
Create Free Account
Binary search algorithm
Known as:
Binary chop
, Binary search
, Bsearch
In computer science, binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ALGOL 60
Algorithmic efficiency
Amortized analysis
Analysis of algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving
A. C. D'Iddio
,
M. Huth
arXiv.org
2017
Corpus ID: 6247524
Optimization of Mixed-Integer Non-Linear Programming (MINLP) supports important decisions in applications such as Chemical…
Expand
2016
2016
Addressing Behavioral Uncertainty in Security Games: An Efficient Robust Strategic Solution for Defender Patrols
T. Nguyen
,
Arunesh Sinha
,
Milind Tambe
IEEE International Symposium on Parallel…
2016
Corpus ID: 47839
Stackelberg Security Games (SSG) have been widely applied for solving real-world security problems - with a significant research…
Expand
2014
2014
A Compressed Suffix-Array Strategy for Temporal-Graph Indexing
N. Brisaboa
,
Diego Caro
,
A. Fariña
,
Michael A. Rodriguez
SPIRE
2014
Corpus ID: 21565396
Temporal graphs represent vertexes and binary relations that change over time. In this paper we consider a temporal graph as a…
Expand
2014
2014
Practical Volume-reduction Strategies for Low-power High-frequency Switch Mode Power Supplies
Aleksandar Radic
2014
Corpus ID: 117123352
The miniaturization of dc–dc switch-mode power supplies (SMPS) is of a key importance in volume-sensitive portable devices, such…
Expand
2013
2013
Quadratic Search: A New and Fast Searching Algorithm (An extension of classical Binary search strategy)
Parveen Kumar
2013
Corpus ID: 172045
It consider the problem of computing efficient strategies for Searching. As a generalization of the classical binary search for…
Expand
2009
2009
Optimum kernel function design from scale space features for object detection
S. Nilufar
,
Nilanjan Ray
,
Hong Zhang
International Conference on Information Photonics
2009
Corpus ID: 604226
Scale-space representation of an image is a significant way to generate features for classification. However, for a specific…
Expand
2005
2005
Scheduling distributed real-time systems by satisfiability checking
Alexander Metzner
,
M. Fränzle
,
Christian Herde
,
Ingo Stierand
IEEE International Conference on Embedded and…
2005
Corpus ID: 17128361
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems. In contrast to the…
Expand
2004
2004
Iterative integer programming formulation for robust resource allocation in dynamic real-time systems
Sethavidh Gertphol
,
V. Prasanna
18th International Parallel and Distributed…
2004
Corpus ID: 6269479
Summary form only given. Dynamic real-time systems often operate in a continuously changing environment, causing workload of the…
Expand
2003
2003
A Pipeline-Based Approach for Scheduling Video Processing Algorithms on NOW
Mau-Tsuen Yang
,
R. Kasturi
,
A. Sivasubramaniam
IEEE Trans. Parallel Distributed Syst.
2003
Corpus ID: 5105784
Network Of Workstations (NOW) platforms put together with off-the-shelf workstations and networking hardware have become a cost…
Expand
1994
1994
Efficient indexing techniques for model based sensing
A. Wallack
,
J. Canny
Proceedings of IEEE Conference on Computer Vision…
1994
Corpus ID: 11039087
Indexing is a model-based recognition technique, in which unknown objects are identified using lookup tables. Indexing…
Expand