Sciweavers

914 search results - page 29 / 183
» Informative performance metrics for dynamic optimisation pro...
Sort
View
BMCBI
2010
121views more  BMCBI 2010»
13 years 6 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
CN
2010
183views more  CN 2010»
13 years 8 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
WWW
2008
ACM
14 years 9 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari
PE
2002
Springer
132views Optimization» more  PE 2002»
13 years 8 months ago
Performance evaluation with temporal rewards
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
Jeroen Voeten
MINENET
2006
ACM
14 years 2 months ago
Privacy-preserving performance measurements
Internet performance is an issue of great interest, but it is not trivial to measure. A number of commercial companies try to measure this, as does RIPE, and many individual Inter...
Matthew Roughan, Yin Zhang