Sciweavers

6031 search results - page 807 / 1207
» Communicating Transaction Processes
Sort
View
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
15 years 11 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
181
Voted
CSE
2009
IEEE
15 years 11 months ago
Social Learning Applications in Resource Constrained Networks
Efficient design of social networking applications must take account of two guiding principles: the adaptive processes by which humans learn and spread new information, and the co...
Ali Saidi, Mahesh V. Tripunitara, Mojdeh Mohtashem...
LCPC
2009
Springer
15 years 11 months ago
MIMD Interpretation on a GPU
Programming heterogeneous parallel computer systems is notoriously difficult, but MIMD models have proven to be portable across multi-core processors, clusters, and massively paral...
Henry G. Dietz, B. Dalton Young
IFL
2001
Springer
15 years 11 months ago
Sized Types for Typing Eden Skeletons
The parallel-functional language Eden extends Haskell with constructs to explicitly define and communicate processes. These extensions allow the easy definition of skeletons as h...
Ricardo Pena, Clara Segura
IFL
2001
Springer
146views Formal Methods» more  IFL 2001»
15 years 11 months ago
Optimizations on Array Skeletons in a Shared Memory Environment
Map- and fold-like skeletons are a suitable abstractions to guide parallel program execution in functional array processing. However, when it comes to achieving high performance, i...
Clemens Grelck