Sciweavers

1763 search results - page 74 / 353
» Dependent random choice
Sort
View
FSEN
2009
Springer
14 years 3 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas
VTC
2006
IEEE
14 years 3 months ago
Semi-Analytical Model of Interference in CDMA-TDD Using Random Time Slot Hopping
— In this paper, a semi-analytical approach for the performance analysis of the random time slot (TS) hopping (RTSH) algorithm applied to code division multiple access time divis...
Ellina Foutekova, Christine Evers, Harald Haas
PEWASUN
2006
ACM
14 years 3 months ago
Analytical modeling of random waypoint mobility patterns
Mobility, in its various forms, is one of the sources of several technical challenges being addressed in the last years to achieve a more flexible computing and communication inf...
Fábio Delamare, Fernando Luís Dotti,...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 2 months ago
Takeover time curves in random and small-world structured populations
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
Mario Giacobini, Marco Tomassini, Andrea Tettamanz...
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
14 years 27 days ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin