Suchergebnisse - Randomized binary search algorithm
-
1
Statistical properties of a class of randomized binary search algorithms
ISSN: 0166-5316Veröffentlicht: Elsevier B.V 01.06.2025Veröffentlicht in Performance evaluation (01.06.2025)“… In this paper, we analyze the statistical properties of a randomized binary search algorithm and its variants …”
Volltext
Journal Article -
2
Randomized time‐varying knapsack problems via binary beetle antennae search algorithm: Emphasis on applications in portfolio insurance
ISSN: 0170-4214, 1099-1476Veröffentlicht: Freiburg Wiley Subscription Services, Inc 30.01.2021Veröffentlicht in Mathematical methods in the applied sciences (30.01.2021)“… The knapsack problem is a problem in combinatorial optimization, and in many such problems, exhaustive search is not tractable …”
Volltext
Journal Article -
3
Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
ISSN: 0097-5397, 1095-7111Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.06.1994Veröffentlicht in SIAM journal on computing (01.06.1994)“… These algorithms involve tackling some of the very basic problems, like binary search and load balancing, that are taken for granted in PRAM models …”
Volltext
Journal Article -
4
Randomized algorithms for binary search and load balancing on fixed connection networks with geometry applications
ISSN: 0097-5397Veröffentlicht: Philadelphia, PA Society for Industrial and Applied Mathematics 1994Veröffentlicht in SIAM journal on computing (1994)Volltext
Journal Article -
5
Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption
ISSN: 0969-6016, 1475-3995Veröffentlicht: Oxford Blackwell Publishing Ltd 01.03.2023Veröffentlicht in International transactions in operational research (01.03.2023)“… To improve the solutions of the greedy algorithm, we then introduce a binary tree …”
Volltext
Journal Article -
6
Bottom-up rebalancing binary search trees by flipping a coin
ISSN: 0304-3975Veröffentlicht: Elsevier B.V 09.11.2025Veröffentlicht in Theoretical computer science (09.11.2025)“… •Space efficient binary search trees.•Randomized rebalancing schemes.•Experimental evaluartion of rebalancing heuristics …”
Volltext
Journal Article -
7
Randomized comparison of defibrillation thresholds from the right ventricular apex and outflow tract
ISSN: 1556-3871, 1556-3871Veröffentlicht: United States 01.11.2010Veröffentlicht in Heart rhythm (01.11.2010)“… A binary search algorithm was used to measure DFT, with initial lead position tested in randomized order …”
Weitere Angaben
Journal Article -
8
Assembling approximately optimal binary search trees efficiently using arithmetics
ISSN: 0020-0190, 1872-6119Veröffentlicht: Amsterdam Elsevier B.V 31.07.2009Veröffentlicht in Information processing letters (31.07.2009)“… The algorithm is simple to implement and it has two contributions. First, a randomized variant of the algorithm produces a binary search tree with expected performance that improves the previous theoretical guarantees …”
Volltext
Journal Article -
9
Impact of unequal cluster sizes for GEE analyses of stepped wedge cluster randomized trials with binary outcomes
ISSN: 0323-3847, 1521-4036, 1521-4036Veröffentlicht: Germany Wiley - VCH Verlag GmbH & Co. KGaA 01.03.2022Veröffentlicht in Biometrical journal (01.03.2022)“… While a convention in study planning is to assume the cluster‐period sizes are identical, SW cluster randomized trials (SW‐CRTs …”
Volltext
Journal Article -
10
Enumerating Maximum Cliques in Massive Graphs
ISSN: 1041-4347, 1558-2191Veröffentlicht: New York IEEE 01.09.2022Veröffentlicht in IEEE transactions on knowledge and data engineering (01.09.2022)“… Besides its theoretical value as an NP-hard problem, the maximum clique problem is known to have direct applications in various fields, such as community search in social networks and social media …”
Volltext
Journal Article -
11
Thick boundaries in binary space and their influence on nearest-neighbor search
ISSN: 0167-8655, 1872-7344Veröffentlicht: Elsevier B.V 01.12.2012Veröffentlicht in Pattern recognition letters (01.12.2012)“… ► We show that binary-space Voronoi diagrams have very thick boundaries. ► This leads to a performance loss of the binary nearest neighbor search algorithms …”
Volltext
Journal Article -
12
Verified Analysis of Random Binary Tree Structures
ISSN: 0168-7433, 1573-0670Veröffentlicht: Dordrecht Springer Netherlands 01.06.2020Veröffentlicht in Journal of automated reasoning (01.06.2020)“… of an unbalanced random Binary Search Tree, the randomised binary search trees described by Martínez and Roura, and the expected shape of a randomised treap …”
Volltext
Journal Article -
13
A nearly optimal randomized algorithm for explorable heap selection
ISSN: 0025-5610, 1436-4646Veröffentlicht: Netherlands Springer Berlin Heidelberg 01.03.2025Veröffentlicht in Mathematical programming (01.03.2025)“… The key values can only be accessed by traversing through the underlying infinite binary tree, and the complexity of the algorithm is measured by the total distance traveled in the tree …”
Volltext
Journal Article -
14
Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 12.04.2024Veröffentlicht in arXiv.org (12.04.2024)“… In this paper we study randomized rebalancing schemes for sequences of \(n\) insertions into an initially empty binary search tree, under the assumption that a tree …”
Volltext
Paper -
15
Supervised Binary Hash Code Learning with Jensen Shannon Divergence
ISSN: 1550-5499Veröffentlicht: IEEE 01.12.2013Veröffentlicht in 2013 IEEE International Conference on Computer Vision (01.12.2013)“… This paper proposes to learn binary hash codes within a statistical learning framework, in which an upper bound of the probability of Bayes decision errors is derived for different forms of hash …”
Volltext
Tagungsbericht Journal Article -
16
Efficient and dynamic verifiable multi-keyword searchable symmetric encryption with full security
ISSN: 1380-7501, 1573-7721Veröffentlicht: New York Springer US 01.07.2021Veröffentlicht in Multimedia tools and applications (01.07.2021)“… There are proposed structures for symmetric searchable encryption (SSE) in this paper, by adding functionalities to randomized SSE schemes, to provide a optimal scheme …”
Volltext
Journal Article -
17
A Randomized Hyperparameter Tuning of Adaptive Moment Estimation Optimizer of Binary Tree-Structured LSTM
ISSN: 2158-107X, 2156-5570Veröffentlicht: West Yorkshire Science and Information (SAI) Organization Limited 2021Veröffentlicht in International journal of advanced computer science & applications (2021)“… Because Adam is an adaptive learning rate method and easier to use than Gradient Descent. In this paper, we propose a novel randomized search method for Adam with randomizing parameters of beta1 and beta2 …”
Volltext
Journal Article -
18
Improvement of the Optimal Design Procedure Using Randomized Algorithm and Process Simulators
ISSN: 2261-236X, 2274-7214, 2261-236XVeröffentlicht: Les Ulis EDP Sciences 01.01.2021Veröffentlicht in MATEC Web of Conferences (01.01.2021)“… Though a global optimization procedure using a randomized algorithm and a commercial process simulator is relatively easy to implement for complex design problems (i.e …”
Volltext
Journal Article Tagungsbericht -
19
On-Device Tiny Machine Learning for Anomaly Detection Based on the Extreme Values Theory
ISSN: 0272-1732, 1937-4143Veröffentlicht: Los Alamitos IEEE 01.11.2023Veröffentlicht in IEEE MICRO (01.11.2023)“… This work presents an unsupervised on-device learning TinyML algorithm, drawing inspiration from the extreme value theory …”
Volltext
Journal Article -
20
A Genetic Algorithm (GA) and Swarm-Based Binary Decision Diagram (BDD) Reordering Optimizer Reinforced With Recent Operators
ISSN: 1089-778X, 1941-0026Veröffentlicht: New York IEEE 01.06.2023Veröffentlicht in IEEE transactions on evolutionary computation (01.06.2023)“… The use of binary decision diagrams (BDDs) has proliferated in numerous fields. When a system criterion is formulated in form of a Boolean function, its BDD is constructed …”
Volltext
Journal Article