Sciweavers

1221 search results - page 2 / 245
» A Comparison of Two Programming Models for Pervasive Computi...
Sort
View
SC
2000
ACM
13 years 10 months ago
A Comparison of Three Programming Models for Adaptive Applications on the Origin2000
Adaptive applications have computational workloads and communication patterns which change unpredictably at runtime, requiring dynamic load balancing to achieve scalable performan...
Hongzhang Shan, Jaswinder Pal Singh, Leonid Oliker...
PPOPP
2009
ACM
14 years 6 months ago
A comparison of programming models for multiprocessors with explicitly managed memory hierarchies
On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and...
Scott Schneider, Jae-Seung Yeom, Benjamin Rose, Jo...
FOGA
2011
12 years 9 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
GEOINFORMATICA
1998
107views more  GEOINFORMATICA 1998»
13 years 5 months ago
A Comparison of Two Approaches to Ranking Algorithms Used to Compute Hill Slopes
The calculation of slope (downhill gradient) for a point in a digital elevation model (DEM) is a common procedure in the hydrological, environmental and remote sensing sciences. T...
Kevin H. Jones
SRDS
2008
IEEE
13 years 12 months ago
Application-Level Recovery Mechanisms for Context-Aware Pervasive Computing
We identify here various kinds of failure conditions and robustness issues that arise in context-aware pervasive computing applications. Such conditions are related to failures in...
Devdatta Kulkarni, Anand Tripathi