222 search results - page 27 / 45 » Symmetry and Search in a Network Design Problem |
131
Voted
GECCO
2008
Springer
15 years 2 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....
113
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
146
click to vote
GECCO
2009
Springer
14 years 11 months ago
2009
Springer
The generation of robot controllers for a task requiring a sequence of elementary behaviors is still a challenge. If these behaviors are known, intermediate steps can be given to ...
110
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
When a considerable number of mutations have no effects on fitness values, the fitness landscape is said neutral. In order to study the interplay between neutrality, which exists ...
145
Voted
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...