149 search results - page 19 / 30 » On Finding Minimum Deadly Sets for Directed Networks |
IMC
2003
ACM
14 years 24 days ago
2003
ACM
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
GIS
2007
ACM
13 years 11 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
SIGPRO
2008
13 years 7 months ago
2008
Recently, the DOA (Direction Of Arrival) estimation of an acoustic wavefront has been considered in a setting where the inference task is performed by a Wireless Sensor Network (W...
ASUNAM
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, we present a horizontal view of social influence, more specifically a quantitative study of the influence of neighbours on the probability of a particular node to jo...
NETWORKS
2006
13 years 7 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...