Sciweavers

242 search results - page 21 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
124
Voted
SPAA
1997
ACM
15 years 6 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
ICASSP
2008
IEEE
15 years 9 months ago
A new Particle Filtering algorithm with structurally optimal importance function
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
Boujemaa Ait-El-Fquih, François Desbouvries
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 8 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
142
Voted
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
15 years 8 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002
98
Voted
COOPIS
1999
IEEE
15 years 6 months ago
Using Fagin's Algorithm for Merging Ranked Results in Multimedia Middleware
A distributed multimedia information system allows users to access data of different modalities, from different data sources, ranked by various combinationsof criteria. In [6], Fa...
Edward L. Wimmers, Laura M. Haas, Mary Tork Roth, ...