Sciweavers

19 search results - page 4 / 4
» Adaptive search with stochastic acceptance probabilities for...
Sort
View
CEC
2010
IEEE
13 years 7 months ago
A novel memetic algorithm for constrained optimization
In this paper, we present a memetic algorithm with novel local optimizer hybridization strategy for constrained optimization. The developed MA consists of multiple cycles. In each ...
Jianyong Sun, Jonathan M. Garibaldi
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
13 years 7 months ago
An EDA based on local markov property and gibbs sampling
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....
Siddhartha Shakya, Roberto Santana
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 6 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
INFOCOM
2006
IEEE
14 years 8 days ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo