1515 search results - page 63 / 303 » Parallel computing on any desktop |
107
click to vote
PODC
2004
ACM
15 years 7 months ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
145
click to vote
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
Modern applications for mobile computing require high performance architectures. On the other hand, there are restrictions such as storage or power consumption. The use of recon...
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...
150
click to vote
ISPAN
2002
IEEE
15 years 6 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...