955 search results - page 37 / 191 » Cover Set Problem in Directional Sensor Networks |
ICANN
2007
Springer
15 years 6 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
101
click to vote
NETCOOP
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we study a pursuit problem in the context of a wireless sensor network, where the pursuer (i.e., mobile sink) trying to capture a pursuee (i.e., tracked object), movi...
130
click to vote
MST
2010
14 years 6 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
IPSN
2005
Springer
15 years 5 months ago
2005
Springer
Abstract—In many sensor networks applications, sensors collect correlated measurements of a physical field, e.g., temperature field in a building or in a data center. However, ...