Sciweavers

9 search results - page 1 / 2
» Reducing I O Complexity by Simulating Coarse Grained Paralle...
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
14 years 1 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
TC
2010
13 years 5 months ago
Scalable Node-Level Computation Kernels for Parallel Exact Inference
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
Yinglong Xia, Viktor K. Prasanna
MCS
2007
Springer
13 years 7 months ago
Parallel unstructured mesh generation by an advancing front method
Mesh generation is a critical step in high fidelity computational simulations. High-quality and high-density meshes are required to accurately capture the complex physical phenome...
Yasushi Ito, Alan M. Shih, Anil K. Erukala, Bharat...
ACMACE
2006
ACM
14 years 1 months ago
Wireless home entertainment center: reducing last hop delays for real-time applications
Future digital entertainment services available to home users will share several characteristics: i) they will be deployed and delivered through the Internet, ii) a single media c...
Claudio E. Palazzi, Giovanni Pau, Marco Roccetti, ...