627 search results - page 110 / 126 » Kolmogorov-Loveland Randomness and Stochasticity |
155
click to vote
GECCO
2007
Springer
16 years 8 days ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
182
click to vote
HPCC
2007
Springer
16 years 8 days ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
168
click to vote
PEWASUN
2006
ACM
16 years 2 days ago
2006
ACM
In wireless multi-hop networks, hello protocols for neighbor discovery are a basic service offered by the networking stack. However, their study usually rely on rather simplistic...
172
click to vote
AE
2005
Springer
15 years 11 months ago
2005
Springer
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
178
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...