Sciweavers

1397 search results - page 180 / 280
» Application Performance of a Linux Cluster Using Converse
Sort
View
AGENTS
1997
Springer
15 years 5 months ago
Yenta: A Multi-Agent, Referral-Based Matchmaking System
Many important and useful applications for software agents require multiple agents on a network that communicate with each other. Such agents must find each other and perform a u...
Leonard N. Foner
FPGA
2007
ACM
124views FPGA» more  FPGA 2007»
15 years 7 months ago
A practical FPGA-based framework for novel CMP research
Chip-multiprocessors are quickly gaining momentum in all segments of computing. However, the practical success of CMPs strongly depends on addressing the difficulty of multithread...
Sewook Wee, Jared Casper, Njuguna Njoroge, Yuriy T...
DOLAP
2004
ACM
15 years 7 months ago
Handling big dimensions in distributed data warehouses using the DWS technique
The DWS (Data Warehouse Striping) technique allows the distribution of large data warehouses through a cluster of computers. The data partitioning approach partition the facts tab...
Marco Costa, Henrique Madeira
BMCBI
2011
14 years 5 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
AI
2010
Springer
15 years 1 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel