Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Ternary search

Known as: Ternary, Trinary search 
A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function. A ternary search determines… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
This paper investigates an optimal offloading mechanism for multi-access edge computing networks with the aid of device-to-device… Expand
  • figure 1
  • table I
  • figure 2
  • figure 4
  • figure 3
2016
2016
is an algorithm that search a particular element in a given list of elements. Sorting Technique is frequently used in a large… Expand
2015
2015
The empirical calculation is displayed in this paper for searching which is an improvement of binary search. On the off chance… Expand
  • table 1
  • table II
2014
2014
Recent advances in virtualization technology enable high mobility of virtual machines (VMs) and resource provisioning at a data… Expand
  • figure 1
  • figure 2
  • table II
  • table III
  • figure 3
2010
2010
Accurate measurement of network parameters such as available bandwidth (ABW), link capacity, delay, packet loss and jitter are… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2010
2010
Accurate measurement of available bandwidth (ABW) is an important parameter to analyze network performance. Active measurement is… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Highly Cited
2006
Highly Cited
2006
Applications in computer networks often require high throughput access to large data structures for lookup and classification… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 5
2004
2004
This note is dedicated to the memory of our teacher E.W. Dijkstra, since he would have appreciated the problem and would probably… Expand
1994
1994
A technique for calibrating an articulated device used in surgery is presented. The process requires only one point in the work… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
1989
1989
In a previous paper, Aigner studied the following search problem on graphs. For a graph G, let e∗ϵE(G) be an unknown edge. In… Expand
  • table 1
  • figure 1
  • figure 2