Sciweavers

17760 search results - page 347 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ATAL
2005
Springer
16 years 12 days ago
Tunably decentralized algorithms for cooperative target observation
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...
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
16 years 11 days ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
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...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
GECCO
2005
Springer
178views Optimization» more  GECCO 2005»
16 years 11 days ago
A co-evolutionary hybrid algorithm for multi-objective optimization of gene regulatory network models
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 ...
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
16 years 11 days ago
Terrain generation using genetic algorithms
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. ...
ICALP
2005
Springer
16 years 11 days ago
Linear Time Algorithms for Clustering Problems in Any Dimensions
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...
Amit Kumar, Yogish Sabharwal, Sandeep Sen