Sciweavers

242 search results - page 1 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
RSA
2002
99views more  RSA 2002»
13 years 4 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott
IPPS
2007
IEEE
13 years 11 months ago
Dynamic Load-Balancing and High Performance Communication in Jcluster
This paper describes the dynamic load-balancing and high performance communication provided in Jcluster, an efficient Java parallel environment. For the efficient loadbalancing,...
Bao-Yin Zhang, Zeyao Mo, Guangwen Yang, Weimin Zhe...
RSA
2006
144views more  RSA 2006»
13 years 4 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
CEC
2005
IEEE
13 years 10 months ago
Memory-enhanced univariate marginal distribution algorithms for dynamic optimization problems
Several approaches have been developed into evolutionary algorithms to deal with dynamic optimization problems, of which memory and random immigrants are two major schemes. This pa...
Shengxiang Yang
INFOCOM
2005
IEEE
13 years 10 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...