Sciweavers

2014 search results - page 286 / 403
» A P2P Approach for Global Computing
Sort
View
IPPS
2007
IEEE
15 years 10 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...
ICPPW
2006
IEEE
15 years 10 months 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
SI3D
2003
ACM
15 years 9 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
RT
2001
Springer
15 years 8 months ago
Path Differentials and Applications
Abstract. Photo-realistic rendering algorithms such as Monte Carlo ray tracing sample individual paths to compute images. Noise and aliasing artefacts are usually reduced by supers...
Frank Suykens, Yves D. Willems
147
Voted
IWCC
1999
IEEE
15 years 8 months ago
A High Performance Communication Subsystem for PODOS
PODOS is a performance oriented distributed operating system being developed to harness the performance capabilities of a cluster computing environment. In order to address the gr...
Sudharshan Vazhkudai, P. Tobin Maginnis