6517 search results - page 246 / 1304 » On optimal service selection |
180
click to vote
IPSN
2004
Springer
16 years 19 days ago
2004
Springer
We propose an entropy-based sensor selection heuristic for localization. Given 1) a prior probability distribution of the target location, and 2) the locations and the sensing mod...
213
click to vote
ICTAI
1993
IEEE
15 years 11 months ago
1993
IEEE
Selecting a set of features which is optimal for a given task is a problem which plays an important role in a wide variety of contexts including pattern recognition, adaptive cont...
206
click to vote
DEXAW
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
208
click to vote
JLP
2011
15 years 2 months ago
2011
Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Servic...
232
click to vote
ADMA
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...