Sciweavers

4670 search results - page 190 / 934
» Testing that distributions are close
Sort
View
GECCO
2004
Springer
107views Optimization» more  GECCO 2004»
15 years 12 months ago
An Evolution Strategy Using a Continuous Version of the Gray-Code Neighbourhood Distribution
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
Jonathan E. Rowe, Dzena Hidovic
ICPP
1992
IEEE
15 years 10 months ago
A unifying Framework for Distributed Routing Algorithms
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
Alan Rooks, Bruno R. Preiss
PARA
2000
Springer
15 years 10 months ago
Runtime Adaptation of an Iterative Linear System Solution to Distributed Environments
Abstract. Distributed cluster environments are becoming popular platforms for high performance computing in lieu of single-vendor supercomputers. However, the reliability and susta...
Masha Sosonkina
ESANN
2004
15 years 8 months ago
Dimensionality reduction and classification using the distribution mapping exponent
: Probability distribution mapping function, which maps multivariate data distribution to the function of one variable, is introduced. Distributionmapping exponent (DME) is somethi...
Marcel Jirina
CAINE
2003
15 years 8 months ago
Optimized Implementation of Distributed Real-Time Embedded Systems Mixing Control and Data Processing
Most distributed real-time embedded systems are specified combining state diagram and data flow languages. This leads to several real-time codes which together do not necessaril...
Nicolas Pernet, Yves Sorel