Sciweavers

1612 search results - page 58 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
TEC
2012
195views Formal Methods» more  TEC 2012»
13 years 5 days ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
ISSS
1999
IEEE
85views Hardware» more  ISSS 1999»
15 years 2 months ago
Efficient Scheduling of DSP Code on Processors with Distributed Register Files
Code generation methods for digital signal processors are increasingly hampered by the combination of tight timing constraints imposed by the algorithms and the limited capacity o...
Bart Mesman, Carlos A. Alba Pinto, Koen Van Eijk
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
14 years 11 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
CORR
2008
Springer
158views Education» more  CORR 2008»
14 years 10 months ago
Distributed and Recursive Parameter Estimation in Parametrized Linear State-Space Models
We consider a network of sensors deployed to sense a spatio-temporal field and infer parameters of interest about the field. We are interested in the case where each sensor's...
S. Sundhar Ram, Venugopal V. Veeravalli, Angelia N...
IWOCA
2009
Springer
134views Algorithms» more  IWOCA 2009»
15 years 4 months ago
Combinatorial Models for Cooperation Networks
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...