46 search results - page 4 / 10 » An exact almost optimal algorithm for target set selection i... |
KDD
2010
ACM
13 years 6 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
CGO
2003
IEEE
14 years 25 days ago
2003
IEEE
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we investigate multi-agent learning (MAL) in a multi-agent resource selection problem (MARS) in which a large group of agents are competing for common resources. Si...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
IAT
2009
IEEE
14 years 2 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....