Sciweavers

1004 search results - page 137 / 201
» High Performance Computing in Science and Engineering
Sort
View
116
Voted
ECAI
2000
Springer
15 years 7 months ago
Search Pruning Conditions for Boolean Optimization
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
Vasco M. Manquinho, João P. Marques Silva
AMAI
2000
Springer
15 years 7 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
CPHYSICS
2008
86views more  CPHYSICS 2008»
15 years 3 months ago
On ERI sorting for SIMD execution of large-scale Hartree-Fock SCF
Given the resurgent attractiveness of single-instruction-multiple-data (SIMD) processing, it is important for high-performance computing applications to be SIMD-capable. The Hartr...
Tirath Ramdas, Gregory K. Egan, David Abramson, Ki...
SC
2009
ACM
15 years 10 months ago
Enabling high-fidelity neutron transport simulations on petascale architectures
The UNIC code is being developed as part of the DOE’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. UNIC is an unstructured, deterministic neutron transport c...
Dinesh K. Kaushik, Micheal Smith, Allan Wollaber, ...
127
Voted
SC
2009
ACM
15 years 10 months ago
Evaluating use of data flow systems for large graph analysis
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
Andy Yoo, Ian Kaplan