The following pages link to Bennett L. Fox (Q1088304):
Displaying 40 items.
- Discrete-time conversion for simulating semi-Markov processes (Q1088305) (← links)
- Spaced batch means (Q1180828) (← links)
- (Q1247915) (redirect page) (← links)
- Branching from the largest upper bound. Folklore and facts (Q1247917) (← links)
- Construction of Voronoi polyhedra (Q1251944) (← links)
- Probabilistic search with overrides (Q1916486) (← links)
- Integrating and accelerating tabu search, simulated annealing, and genetic algorithms (Q2366994) (← links)
- Adaptive age replacement (Q2554992) (← links)
- Adaptive policies for Markov renewal programs (Q2560098) (← links)
- Replication Schemes For Limiting Expectations (Q3415931) (← links)
- Estimating Derivatives Via Poisson's Equation (Q3416023) (← links)
- Simulating Discounted Costs (Q3488983) (← links)
- (Q3662646) (← links)
- Estimating Time Averages via Randomly-Spaced Observations (Q3750863) (← links)
- Algorithm 659 (Q3783398) (← links)
- Technical Note—Enforcing Constraints on Expanded Networks (Q3896863) (← links)
- (Q3908785) (← links)
- Coupled Successive Approximations for Markov Programs (Q3939619) (← links)
- Discrete-Time Conversion for Simulating Finite-Horizon Markov Processes (Q3970579) (← links)
- Generating Markov-Chain Transitions Quickly: II (Q4025893) (← links)
- Generating Markov-Chain Transitions Quickly: I (Q4029055) (← links)
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets (Q4173214) (← links)
- Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound (Q4193265) (← links)
- Shortening Future-Event Lists (Q4202581) (← links)
- Programs to generate Niederreiter's low-discrepancy sequences (Q4371724) (← links)
- Separability in Optimal Allocation (Q4530645) (← links)
- Filtering the Feynman--KAC Formula (Q4539411) (← links)
- Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators (Q4723131) (← links)
- Faster Simulated Annealing (Q4852577) (← links)
- (Q4856452) (← links)
- (Q4856462) (← links)
- Implementation and tests of low-discrepancy sequences (Q4876078) (← links)
- Letter to the Editor—Age Replacement with Discounting (Q5524168) (← links)
- Markov Renewal Programming by Linear Fractional Programming (Q5535548) (← links)
- Existence of Stationary Optimal Policies for Some Markov Renewal Programs (Q5541767) (← links)
- Discrete Optimization Via Marginal Analysis (Q5561620) (← links)
- Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix (Q5567482) (← links)
- Accelerating LP algorithms (Q5578028) (← links)
- Searching for the Multiplier in One-Constraint Optimization Problems (Q5592014) (← links)
- Multichain Markov Renewal Programs (Q5598761) (← links)