Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,794,577 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.
2014
2014
Practical Volume-reduction Strategies for Low-power High-frequency Switch Mode Power Supplies
A. 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
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
2009
2009
Implementation of the Enhanced Binary-SIME method for finding transient stability limits with PSS/E™
H.M. Tan
,
D. Vowles
,
R. Zivanovic
IEEE Bucharest PowerTech
2009
Corpus ID: 34522137
The Enhanced Binary-Single Machine Infinite bus Equivalent (Binary-SIME) method is an enhancement of the SIME method. It provides…
Expand
2007
2007
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
F. Aloul
,
Bashar Al-Rawi
,
M. Aboelaze
Journal of Communications
2007
Corpus ID: 9029052
Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s…
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
2004
2004
Hardware-efficient schemes for logarithmic approximation and binary search with application to visibility graph construction
S. Lam
,
K. Sridharan
,
T. Srikanthan
IEEE transactions on industrial electronics…
2004
Corpus ID: 206697064
Visibility graphs constitute a useful data structure for environment representation in the context of robot path planning. A…
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
2002
2002
Minimum perfect hashing for fast n-gram language model lookup
Xiao Zhang
,
Yunxin Zhao
Interspeech
2002
Corpus ID: 8250140
A new technique is proposed for N-gram language model (LM) retrieval based on minimum perfect hashing (MPH). A hierarchical data…
Expand
1992
1992
Image Approximation by Self Aane Fractals
F. Dudbridge
,
W. Penney
,
+4 authors
D. Fung
1992
Corpus ID: 14370117
This thesis describes a novel method for approximating digital images and similar data. The work is based on deterministic…
Expand