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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

The miniaturization of dc–dc switch-mode power supplies (SMPS) is of a key importance in volume-sensitive portable devices, such…

2014

Temporal graphs represent vertexes and binary relations that change over time. In this paper we consider a temporal graph as a…

2009

The Enhanced Binary-Single Machine Infinite bus Equivalent (Binary-SIME) method is an enhancement of the SIME method. It provides…

2007

Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s…

2005

We present a SAT-based approach to the task and message allocation problem of distributed real-time systems. In contrast to the…

2003

Network Of Workstations (NOW) platforms put together with off-the-shelf workstations and networking hardware have become a cost…

2002

A new technique is proposed for N-gram language model (LM) retrieval based on minimum perfect hashing (MPH). A hierarchical data…

1999

As memory becomes cheaper and larger in capacity, more and more databases are being stored entirely in main memory. Furthermore…

1992

This thesis describes a novel method for approximating digital images and similar data. The work is based on deterministic…

1983

In this paper we consider variations on the binary search algorithm when placed in the context of a multiprocessing environment…