Sciweavers

2253 search results - page 258 / 451
» Computing with Realizational Morphology
Sort
View
IPPS
2007
IEEE
16 years 27 days 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...
IPPS
2007
IEEE
16 years 27 days ago
The Adaptive Code Kitchen: Flexible Tools for Dynamic Application Composition
Driven by the increasing componentization of scientific codes, the deployment of high-end system infrastructures such as the Grid, and the desire to support high level problem so...
Pilsung Kang 0002, Mike Heffner, Joy Mukherjee, Na...
GLOBECOM
2006
IEEE
16 years 19 days ago
On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Mahalingam Ramkumar
ICPPW
2006
IEEE
16 years 19 days ago
Retargeting Image-Processing Algorithms to Varying Processor Grain Sizes
Embedded computing architectures can be designed to meet a variety of application specific requirements. However, optimized hardware can require compiler support to realize the po...
Sam Sander, Linda M. Wills
JVA
2006
IEEE
16 years 18 days ago
Dependability in Hybrid Grid Systems: A Virtual Clusters Approach
With the rapid evolution of mobile and ubiquitous computing, small-scale devices like personal digital assistants, smart "converged" phones and laptops now dominate the ...
Stavros Isaiadis, Vladimir Getov