3831 search results - page 353 / 767 » Dynamic Context Logic |
175
click to vote
GLOBECOM
2006
IEEE
16 years 20 days 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...
182
click to vote
APLAS
2005
ACM
16 years 5 days ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
181
click to vote
HIPEAC
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to...
188
click to vote
SSD
2005
Springer
16 years 3 days ago
2005
Springer
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
169
click to vote
MDM
2004
Springer
15 years 12 months 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....