• Home
  • Search
  • Discrete random variates with finite support using differential search trees
  • https://doi.org/10.1177/00375497241235199Copy DOI Icon

Discrete random variates with finite support using differential search trees

Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

Differential search trees can be used for selection with replacement and for a form of selection without replacement. We show that they can be extended to many different types of selection, both with and without replacement. In addition, virtually every aspect of a differential search tree can be modified dynamically. We provide algorithms for making these modifications. Virtually all differential search tree algorithms are straightforward and easy to implement, especially with our preferred implementation, which is both simple and efficient. Differential search tree operations are virtually all logarithmic with the exception of building the tree and dynamically adding leaves to the tree, which are both linear.

Similar Papers
  • Research Article
  • Citations99

The Scenario Generation Algorithm for Multistage Stochastic Linear Programming

  • Aug 01, 2005
  • Mathematics of Operations Research
  • Michael S Casey +1
  • Research Article
  • Citations3

Metastability for Glauber Dynamics on the Complete Graph with Coupling Disorder

  • Mar 17, 2022
  • Communications in Mathematical Physics
  • Anton Bovier +2
  • Research Article
  • Citations4

Stability in the decomposition of probability measures with finite support

  • Jan 01, 1972
  • Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete
  • Olav Kallenberg
  • Conference Article
  • Citations4

Plug-in Estimator of the Entropy Rate of a Pure-Jump Two-State Markov Process

  • Jan 01, 2009
  • AIP conference proceedings
  • Philippe Regnault +2
  • Research Article
  • Citations38

Dynamic Generation of Discrete Random Variates

  • Jun 06, 2003
  • Theory of Computing Systems
  • Yossi Matias +2
  • PDF
  • Research Article
  • Citations9

A Survey of VLSI Implementations of Tree Search Algorithms for MIMO Detection

  • Dec 30, 2015
  • Circuits, Systems, and Signal Processing
  • Ibrahim A Bello +3
  • Research Article
  • Citations14

Matrix description of differential relations of moment functions in structural reliability sensitivity analysis

  • Dec 02, 2016
  • Applied Mathematics and Mechanics
  • Tianxiao Zhang
  • Conference Article
  • Citations1

An average-case analysis of graph search

  • Jul 28, 2002
  • Arunava Sen +2
  • Dissertation

Integrating Domain knowledge into Monte Carlo Tree Search for Real-Time Strategy Games

  • Jun 01, 2022
  • Zuozhi Yang +1
  • Research Article
  • Citations2

Identities involving expectations of certain random variables and degenerate Stirling numbers

  • Oct 04, 2025
  • Integral Transforms and Special Functions
  • Taekyun Kim +1
  • Research Article
  • Citations29

Nonparametric Probabilistic Load Flow With Saddle Point Approximation

  • Sep 01, 2018
  • IEEE Transactions on Smart Grid
  • Mohammad Mohammadi +2
  • Research Article
  • Citations21

Existence of chaos and the approximate solution of the Lorenz–Lü–Chen system with the Caputo fractional operator

  • Jan 01, 2024
  • AIP Advances
  • Najat Almutairi +1
  • Research Article
  • Citations8

A UCB-Based Tree Search Approach to Joint Verification-Correction Strategy for Large-Scale Systems

  • Sep 01, 2023
  • IEEE Transactions on Systems, Man, and Cybernetics: Systems
  • Peng Xu +2
  • Conference Article
  • Citations1

Multiple-Paths Search with Concurrent Thread Scheduling for Fast AND/OR Tree Search

  • Mar 01, 2009
  • Fumiyo Takano +2
  • Research Article
  • Citations3

Brain MRI Images Classifications with Deep Fuzzy Clustering and Deep Residual Network

  • Jan 31, 2022
  • International Journal of Computational Methods
  • R Rajeswari +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.