403 search results - page 23 / 81 » Sampling Bounds for Stochastic Optimization |
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
GECCO
2011
Springer
13 years 1 months ago
2011
Springer
This paper introduces mirrored sampling into evolution strategies (ESs) with weighted multi-recombination. Two further heuristics are introduced: pairwise selection selects at mos...
ICASSP
2009
IEEE
14 years 4 months ago
2009
IEEE
Recently, it has been shown that it is possible to sample non-bandlimited signals that possess a limited number of degrees of freedom and uniquely reconstruct them from a finite ...
CCE
2006
13 years 10 months ago
2006
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
MOBICOM
2006
ACM
14 years 3 months ago
2006
ACM
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...