Sciweavers

1415 search results - page 183 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
CLUSTER
2009
IEEE
14 years 4 months ago
An innovative application execution toolkit for multicluster grids
—Multicluster grids provide one promising solution to satisfying growing computation demands of compute-intensive applications by collaborating various networked clusters. Howeve...
Zhifeng Yun, Zhou Lei, Gabrielle Allen, Daniel S. ...
MIDDLEWARE
2005
Springer
14 years 3 months ago
I-RMI: Performance Isolation in Information Flow Applications
A problem with many distributed applications is their behavior in lieu of unpredictable variations in user request volumes or in available resources. This paper explores a performa...
Mohamed S. Mansour, Karsten Schwan
EUC
2006
Springer
14 years 1 months ago
Saving Register-File Leakage Power by Monitoring Instruction Sequence in ROB
- Modern portable or embedded systems support more and more complex applications. These applications make embedded devices require not only low powerconsumption, but also high comp...
Wann-Yun Shieh, Hsin-Dar Chen
MOC
2000
173views more  MOC 2000»
13 years 10 months ago
Computation of Gauss-Kronrod quadrature rules
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
Daniela Calvetti, Gene H. Golub, William B. Gragg,...
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
14 years 2 months ago
Proposal and Empirical Comparison of a Parallelizable Distance-Based Discretization Method
Many classification algorithms are designed to work with datasets that contain only discrete attributes. Discretization is the process of converting the continuous attributes of ...
Jesús Cerquides, Ramon López de M&aa...