4841 search results - page 245 / 969 » On dynamic feature location |
183
click to vote
ISQED
2008
IEEE
16 years 1 months ago
2008
IEEE
Clock meshes have found increasingly wide applications in today’s high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved cl...
204
click to vote
GLOBECOM
2006
IEEE
16 years 1 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
200
click to vote
IPPS
2005
IEEE
16 years 24 days ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
186
click to vote
MDM
2004
Springer
16 years 17 days ago
2004
Springer
In this paper, we propose a middleware library for efficiently developing distributed cooperative applications consisting of a large number of cellular phones with Java executors....
181
click to vote
OOPSLA
2004
Springer
16 years 17 days ago
2004
Springer
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...