default search action
International Journal of Approximate Reasoning, Volume 31
Volume 31, Number 1-2, October 2002
- Philippe Smets:
The application of the matrix calculus to belief functions. 1-30 - Boutheina Ben Yaghlane, Philippe Smets, Khaled Mellouli:
Belief function independence: II. The conditional case. 31-75 - Thierry Denoeux, Amel Ben Yaghlane:
Approximating the combination of belief functions using the fast Mo"bius transform in a coarsened frame. 77-101 - Rolf Haenni, Norbert Lehmann:
Resource bounded and anytime approximation of belief function computations. 103-154
Volume 31, Number 3, November 2002
- Pedro Larrañaga, José Antonio Lozano:
Synergies between evolutionary computation and probabilistic graphical models. 155-156 - Heinz Mühlenbein, Thilo Mahnig:
Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning. 157-192 - Shumeet Baluja:
Using a priori knowledge to create probabilistic models for optimization. 193-220 - Martin Pelikan, Kumara Sastry, David E. Goldberg:
Scalability of the Bayesian optimization algorithm. 221-258 - Peter A. N. Bosman, Dirk Thierens:
Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms. 259-289 - Luis M. de Campos, Juan M. Fernández-Luna, José A. Gámez, José Miguel Puerta:
Ant colony optimization for learning Bayesian networks. 291-311 - Cristina González, José Antonio Lozano, Pedro Larrañaga:
Mathematical modelling of UMDAc algorithm with tournament selection. Behaviour on linear and quadratic functions. 313-340
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.