International journal of approximate reasoning

• 

  Año 2002, Vol. 29, Número 1

  • Using probability trees to compute marginals with imprecise probabilities

    A. Cano, S. Moral

    págs. 1-46

    

  • Belief function independence: I. The marginal case

    B. Ben Yaghlane

    págs. 47-70

    

  • Soft evidential update for probabilistic multiagent systems

    M. Valtorta

    págs. 71-106

    
• 

  Año 2002, Vol. 29, Número 2

  • Troubleshooting using probabilistic networks and value of information

    Taner Bilgiç, Korhan Gökçay

    págs. 107-133

    

  • On the transformation between possibilistic logic bases and possibilistic causal networks

    Laurent García, Didier Dubois, Henri Prade, Salem Benferhat

    págs. 135-173

    

  • Some relationships between fuzzy and random set-based classifiers and models

    Marıa José del Jesus, Luciano Sánchez, Oscar Cordón, Jorge Casillas

    págs. 175-213

    
• 

  Año 2002, Vol. 30, Número 3

  • A heuristic algorithm for computing the max¿min inverse fuzzy relation

    Amit Konar, Parbati Saha

    págs. 131-147

    

  • Neuro-fuzzy approach to processing inputs with missing values in pattern recognition problems

    Bogdan Gabrys

    págs. 149-179

    

  • Networks of probabilistic events in discrete time

    Francisco J. D¿ez, Severino F. Galán

    págs. 181-202

    

  • A parametric representation of linguistic hedges in Zadeh¿s fuzzy logic

    V.N. Huynh, T.B. Ho, Y. Nakamori

    págs. 203-223

    

  • Author index

    pág. 225

    

  • Subject index

    pág. 227

    
• 

  Año 2002, Vol. 31, Número 1

  • The application of the matrix calculus to belief functions

    Philippe Smets

    págs. 1-30

    

  • Belief function independence: II. The conditional case

    Philippe Smets, Boutheina Ben Yaghlane, Khaled Mellouli

    págs. 31-75

    

  • Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame

    Amel Ben Yaghlane, Thierry Den¿ux

    págs. 77-101

    

  • Resource bounded and anytime approximation of belief function computations

    Norbert Lehmann, Rolf Haenni

    págs. 103-154

    
• 

  Año 2002, Vol. 31, Número 3

  • Synergies between evolutionary computation and probabilistic graphical models

    Pedro Larrañaga, Jose A. Lozano

    págs. 155-156

    

  • Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning

    Th. Mahnig, H. Mühlenbein

    págs. 157-192

    

  • Using a priori knowledge to create probabilistic models for optimization

    Shumeet Baluja

    págs. 193-220

    

  • Scalability of the Bayesian optimization algorithm

    David E. Goldberg, Martin Pelikan, Kumara Sastry

    págs. 221-258

    

  • Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms

    Dirk Thierens, Peter A.N. Bosman

    págs. 259-289

    

  • Ant colony optimization for learning Bayesian networks

    José A. Gámez, Juan M. Fernández-Luna, José M. Puerta, Luis M. de Campos

    págs. 291-311

    

  • Mathematical modelling of UMDA<sub>c</sub> algorithm with tournament selection. Behaviour on linear and quadratic functions

    C. González, P. Larrañaga, J.A. Lozano

    págs. 313-340

    

  • Author index

    pág. 341

    

  • Subject index

    pág. 343