Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
Sean Luke, Keith Sullivan, Liviu Panait, Gabriel C...
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
In this paper, the parameters of a genetic network for rice flowering time control have been estimated using a multiobjective genetic algorithm approach. We have modified the rece...
Praveen Koduru, Sanjoy Das, Stephen Welch, Judith ...
We propose a method for applying genetic algorithms to create 3D terrain data sets. Existing procedural algorithms for generation of terrain have several shortcomings. The most po...
TeongJoo Ong, Ryan Saunders, John Keyser, John J. ...
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...