390 search results - page 12 / 78 » When is an estimation of distribution algorithm better than ... |
IPPS
2002
IEEE
14 years 8 days ago
2002
IEEE
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
ECML
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. In this paper we consider latent variable models and introduce a new U-likelihood concept for estimating the distribution over hidden variables. One can derive an estimat...
WIOPT
2005
IEEE
14 years 28 days ago
2005
IEEE
With multipath routing in mobile ad hoc networks (MANETs), a source can establish multiple routes to a destination for routing data. In MANETs, mulitpath routing can be used to pr...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
We study how different prediction update algorithms influence the performance of XCSF. We consider three classical parameter estimation algorithms (NLMS, RLS, and Kalman filter) a...
IPCO
2010
13 years 8 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...