6506 search results - page 996 / 1302 » Algorithmic models for sensor networks |
128
click to vote
FMCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Attack graphs depict ways in which an adversary exploits system vulnerabilities to achieve a desired state. System administrators use attack graphs to determine how vulne...
105
click to vote
AINA
2009
IEEE
15 years 10 months ago
2009
IEEE
— For an application in public-resource computing environments, providing reliable scheduling based on resource reliability evaluation is becoming increasingly important. Most ex...
136
click to vote
CCCG
2008
15 years 5 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
138
click to vote
ISPA
2005
Springer
15 years 9 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
202
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...