The following pages link to Benny Van Houdt (Q335904):
Displaying 44 items.
- Transient and steady-state regime of a family of list-based cache replacement algorithms (Q335905) (← links)
- (Q475105) (redirect page) (← links)
- A mean field model for a class of garbage collection algorithms in flash-based solid state drives (Q475106) (← links)
- Analysis of lead time correlation under a base-stock policy (Q666961) (← links)
- Performance analysis of work stealing strategies in large scale multi-threaded computing (Q832084) (← links)
- Analyzing priority queues with 3 classes using tree-like processes (Q854994) (← links)
- An integrated production and inventory model to dampen upstream demand variability in the supply chain (Q857368) (← links)
- (Q928192) (redirect page) (← links)
- QBD Markov chains on binomial-like trees and its application to multilevel feedback queues (Q928194) (← links)
- On the link between Markovian trees and tree-structured Markov chains (Q1038338) (← links)
- (Q1411365) (redirect page) (← links)
- Delay distribution of (im)patient customers in a discrete time D-MAP/PH/1 queue with age-dependent service times (Q1411366) (← links)
- Inpatient boarding in emergency departments: impact on patient delays and system capacity (Q1653378) (← links)
- Analysis of the adaptive \(MMAP[K]/PH[K]/1\) queue: a multi-type queue with adaptive arrivals and general impatience (Q1926786) (← links)
- Open problems in refined mean field approximations (Q2146402) (← links)
- Coordinating lead times and safety stocks under autocorrelated demand (Q2255886) (← links)
- Characterizing order processes of continuous review \((s,S)\) and \((r,nQ)\) policies (Q2356265) (← links)
- Response time in a tandem queue with blocking, Markovian arrivals and phase-type services (Q2488232) (← links)
- Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks (Q2493521) (← links)
- On the probability of abandonment in queues with limited sojourn and waiting times (Q2494831) (← links)
- STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN (Q2746221) (← links)
- Impact of Dampening Demand Variability in a Production/Inventory System with Multiple Retailers (Q2841729) (← links)
- THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS (Q2884251) (← links)
- Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains (Q2899110) (← links)
- Commuting Matrices in the Queue Length and Sojourn Time Analysis of MAP/MAP/1 Queues (Q2937475) (← links)
- A Fast Newton's Iteration for M/G/1-Type and GI/M/1-Type Markov Chains (Q3145418) (← links)
- The delay distribution of a type <i>k</i> customer in a first-come-first-served MMAP[<i>K</i>]/PH[<i>K</i>]/1 queue (Q3147427) (← links)
- Markovian Approximations for a Grid Computing Network with a Ring Structure (Q3161156) (← links)
- On the Dual Relationship Between Markov Chains of GI/M/1 and M/G/1 Type (Q3566399) (← links)
- The Impact of Buffer Finiteness on the Loss Rate in a Priority Queueing System (Q3613677) (← links)
- Tree Structured QBD Markov Chains and Tree‐Like QBD Processes (Q4431306) (← links)
- The Waiting Time Distribution of a Type<i>k</i>Customer in a Discrete-Time MMAP[K]/PH[K]/c (c = 1, 2) Queue Using QBDs (Q4451556) (← links)
- (Q4793348) (← links)
- On the Maximum Stable Throughput of Tree Algorithms With Free Access (Q4974062) (← links)
- Simple analytical solutions for the , , and related queues (Q5049900) (← links)
- Performance evaluation of a production/inventory system with periodic review and endogenous lead times (Q5436965) (← links)
- Approximated Transient Queue Length and Waiting Time Distributions via Steady State Analysis (Q5462814) (← links)
- Response Time Distribution in a D-MAP/PH/1 Queue with General Customer Impatience (Q5462815) (← links)
- On the impact of job size variability on heterogeneity-aware load balancing (Q5915730) (← links)
- On the impact of job size variability on heterogeneity-aware load balancing (Q5919032) (← links)
- Join-Up-To\((m)\): improved hyperscalable load balancing (Q6195495) (← links)
- Tail Optimality and Performance Analysis of the Nudge-M Scheduling Algorithm (Q6525494) (← links)
- On the maximum queue length of the hyper scalable load balancing push strategy (Q6546452) (← links)
- Performance analysis of work stealing strategies in large-scale multithreaded computing (Q6599362) (← links)
