International journal of approximate reasoning

• 

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

  • Synergies between evolutionary computation and probabilistic graphical models

    Pedro Larrañaga Múgica, José Antonio Lozano Alonso

    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é Antonio Gámez Martín, Juan Manuel Fernández Luna, José Miguel Puerta Callejón, Luis M. de Campos

    págs. 291-311

    

  • Mathematical modelling of UMDA algorithm with tournament selection: behaviour on linear and quadratic functions

    C. González, Pedro Larrañaga Múgica, José Antonio Lozano Alonso

    págs. 313-340

    

  • Author index

    pág. 341

    

  • Subject index

    pág. 343