844 search results - page 70 / 169 » Solving the p |
SIAMCOMP
2000
14 years 9 months ago
2000
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
ICAI
2010
14 years 7 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
Website privacy policies state the ways that a site will use personal identifiable information (PII) that is collected from fields and forms in web-based transactions. Since these...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pse...
ICDCSW
2007
IEEE
15 years 4 months ago
2007
IEEE
Although P2P-based DVEs can potentially solve the scalability issues, other important issues such as consistency remain unexplored. In this paper, we address neighborship consiste...