16404 search results - page 2410 / 3281 » A set coverage problem |
218
click to vote
IANDC
2008
15 years 7 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
200
click to vote
CCR
2006
15 years 7 months ago
2006
The rapid growth of the Internet over the last decade has been startling. However, efforts to track its growth have often fallen afoul of bad data -- for instance, how much traffi...
222
click to vote
CPHYSICS
2006
15 years 7 months ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
173
click to vote
COMCOM
2007
15 years 7 months ago
2007
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
214
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...