16404 search results - page 494 / 3281 » A set coverage problem |
240
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
169
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
213
click to vote
ICAC
2009
IEEE
16 years 1 months ago
2009
IEEE
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...
222
click to vote
ALGOSENSORS
2009
Springer
16 years 1 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
205
click to vote
AAAI
2008
15 years 9 months ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...