Pages that link to "Item:Q3959243"

The following pages link to Hitting-time and occupation-time bounds implied by drift analysis with applications (Q3959243):

Displaying 50 items.

• Runtime analysis of non-elitist populations: from classical optimisation to partial information (Q306486) (← links)
• Concentration of first hitting times under additive drift (Q306489) (← links)
• MMAS versus population-based EA on a family of dynamic fitness functions (Q306495) (← links)
• Asymptotically tight steady-state queue length bounds implied by drift conditions (Q373455) (← links)
• A performance analysis of channel fragmentation in dynamic spectrum access systems (Q383269) (← links)
• Fluid limits for an ALOHA-type model with impatient customers (Q383289) (← links)
• Approximating fixation probabilities in the generalized Moran process (Q472467) (← links)
• Drift analysis of mutation operations for biogeography-based optimization (Q521639) (← links)
• Simplified drift analysis for proving lower bounds in evolutionary computation (Q633834) (← links)
• Distributed algorithms for QoS load balancing (Q658665) (← links)
• Rank-driven Markov processes (Q664588) (← links)
• A certainty equivalence principle based nonlinear separation control rule for random access channels: Stability and delay analysis (Q803100) (← links)
• A survey of the modified Moran process and evolutionary graph theory (Q826319) (← links)
• Improved time complexity analysis of the simple genetic algorithm (Q888423) (← links)
• Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms (Q894817) (← links)
• Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space (Q976221) (← links)
• Some exponential type bounds for hitting time distributions of storage processes (Q1076600) (← links)
• Ergodic and adaptive control of nearest-neighbor motions (Q1176541) (← links)
• Simulated annealing - to cool or not (Q1262289) (← links)
• On the stability of open networks: A unified approach by stochastic dominance (Q1319172) (← links)
• Asymptotically exact analysis of a loss network with channel continuity (Q1429113) (← links)
• Moment conditions for a sequence with negative drift to be uniformly bounded in \(L^r\) (Q1613608) (← links)
• Optimal heavy-traffic queue length scaling in an incompletely saturated switch (Q1649970) (← links)
• Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax (Q1725646) (← links)
• Self-stabilizing repeated balls-into-bins (Q1733393) (← links)
• Self-stabilizing balls and bins in batches. The power of leaky bins (Q1799218) (← links)
• Stabilizing an uncertain production system (Q1824543) (← links)
• The Kumar-Becker-Lin scheme revisited (Q1824599) (← links)
• Adaptive drift analysis (Q1939672) (← links)
• Multiplicative drift analysis (Q1945169) (← links)
• Black-box search by unbiased variation (Q1945171) (← links)
• Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems (Q2060617) (← links)
• An ODE method to prove the geometric convergence of adaptive stochastic algorithms (Q2074991) (← links)
• Deposition, diffusion, and nucleation on an interval (Q2108910) (← links)
• Does comma selection help to cope with local optima? (Q2144274) (← links)
• Self-adjusting evolutionary algorithms for multimodal optimization (Q2144276) (← links)
• Mobility can drastically improve the heavy traffic performance from \(\frac{1}{1-\varrho}\) to \(\log(1/(1-\varrho))\) (Q2210660) (← links)
• Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint (Q2240133) (← links)
• On the runtime analysis of the simple genetic algorithm (Q2250994) (← links)
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm (Q2250995) (← links)
• Equilibria of dynamic games with many players: existence, approximation, and market structure (Q2253841) (← links)
• First-hitting times under drift (Q2333786) (← links)
• A new approach to estimating the expected first hitting time of evolutionary algorithms (Q2389686) (← links)
• Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks (Q2443186) (← links)
• Recent advances in evolutionary computation (Q2508374) (← links)
• Ergodicity properties of rerouting strategies in queueing networks (Q2564189) (← links)
• Analysis of noisy evolutionary optimization when sampling fails (Q2661993) (← links)
• Runtime analysis for self-adaptive mutation rates (Q2661995) (← links)
• Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift (Q2942670) (← links)
• Drift Analysis and Evolutionary Algorithms Revisited (Q3177365) (← links)