Sciweavers

5675 search results - page 256 / 1135
» Exploiting Chaos for Computation
Sort
View
IPPS
2007
IEEE
16 years 1 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
EEMMAS
2007
Springer
16 years 1 months ago
Engineering Contextual Information for Pervasive Multiagent Systems
Multiagent systems for mobile and pervasive computing should extensively exploit contextual information both to adapt to user needs and to enable autonomic behavior. This raises th...
Gabriella Castelli, Marco Mamei, Franco Zambonelli
UDM
2005
IEEE
16 years 27 days ago
Challenges and Opportunities of Context-Aware Information Access
Ubiquitous computing environments embedding a wide range of pervasive computing technologies provide a challenging and exciting new domain for information access. Individuals work...
Gareth J. F. Jones
ICVS
2001
Springer
15 years 11 months ago
Compiling SA-C Programs to FPGAs: Performance Results
Abstract. At the first ICVS, we presented SA-C (“sassy”), a singleassignment variant of the C programming language designed to exploit both coarse-grain and fine-grain parallel...
Bruce A. Draper, A. P. Wim Böhm, Jeffrey Hamm...
JPDC
2006
106views more  JPDC 2006»
15 years 7 months ago
Performance characteristics of the multi-zone NAS parallel benchmarks
We describe a new suite of computational benchmarks that models applications featuring multiple levels of parallelism. Such parallelism is often available in realistic flow comput...
Haoqiang Jin, Rob F. Van der Wijngaart