1221 search results - page 228 / 245 » A Comparison of Two Programming Models for Pervasive Computi... |
COR
2010
13 years 8 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
SIGSOFT
2010
ACM
13 years 6 months ago
2010
ACM
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...
ICASSP
2009
IEEE
13 years 6 months ago
2009
IEEE
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
ICCAD
2005
IEEE
14 years 5 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
MMM
2005
Springer
14 years 2 months ago
2005
Springer
In distributed computing systems, it is unwise to move data to the point of program code, but instead process data at the point of storage. This concept is even more appropriate t...