We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
In this paper a new approach to solve constrained multi-objective problems by way of evolutionary multi-objective optimization is introduced. In contrast to former evolutionary ap...
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Abstract- This paper presents an approach of using Differential Evolution (DE) to solve dynamic optimization problems. Careful setting of parameters is necessary for DE algorithms ...