2100 search results - page 239 / 420 » Fundamentals of the problem |
IWSOS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
ASPDAC
2006
ACM
14 years 4 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
SAC
2006
ACM
14 years 4 months ago
2006
ACM
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...
ISCA
2005
IEEE
14 years 4 months ago
2005
IEEE
We propose “secret-protected (SP)” architecture to enable secure and convenient protection of critical secrets for a given user in an on-line environment. Keys are examples of...
ADC
2005
Springer
14 years 4 months ago
2005
Springer
XML query caching for XML database-backed Web applications began to be investigated recently. However, the issue of how the cached query results are stored has not been addressed ...