Sciweavers

5692 search results - page 350 / 1139
» Challenges and Unsolved Problems
Sort
View
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
16 years 7 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
155views Optimization» more  GECCO 2005»
16 years 6 days ago
An artificial immune network for multimodal function optimization on dynamic environments
Multimodal optimization algorithms inspired by the immune system are generally characterized by a dynamic control of the population size and by diversity maintenance along the sea...
Fabrício Olivetti de França, Fernand...
205
Voted
GFKL
2005
Springer
141views Data Mining» more  GFKL 2005»
16 years 6 days ago
On External Indices for Mixtures: Validating Mixtures of Genes
Mixture models represent results of gene expression cluster analysis in a more natural way than ’hard’ partitions. This is also true for the representation of gene labels, such...
Ivan G. Costa, Alexander Schliep
IPSN
2005
Springer
16 years 6 days ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry
WLP
2005
Springer
16 years 5 days ago
Expressing Interaction in Combinatorial Auction through Social Integrity Constraints
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
Marco Alberti, Federico Chesani, Alessio Guerri, M...