Sciweavers

968 search results - page 96 / 194
» A faster implementation of APlace
Sort
View
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 10 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
ISCA
2006
IEEE
151views Hardware» more  ISCA 2006»
15 years 10 months ago
The BlackWidow High-Radix Clos Network
This paper describes the radix-64 folded-Clos network of the Cray BlackWidow scalable vector multiprocessor. We describe the BlackWidow network which scales to 32K processors with...
Steve Scott, Dennis Abts, John Kim, William J. Dal...
COMPSAC
2005
IEEE
15 years 10 months ago
Considerations on a New Software Architecture for Distributed Environments Using Autonomous Semantic Agents
Distributed processing environments such as that of a traffic management network system (TMS) can be implemented easier, faster, and secure and perform better through use of auton...
Atilla Elçi, Behnam Rahnama
SC
2004
ACM
15 years 9 months ago
GPU Cluster for High Performance Computing
Inspired by the attractive Flops/dollar ratio and the incredible growth in the speed of modern graphics processing units (GPUs), we propose to use a cluster of GPUs for high perfo...
Zhe Fan, Feng Qiu, Arie E. Kaufman, Suzanne Yoakum...
AUSAI
2004
Springer
15 years 9 months ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...