Sciweavers

7195 search results - page 113 / 1439
» On Computing Power
Sort
View
IPPS
2006
IEEE
14 years 5 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang
DAC
2004
ACM
15 years 4 days ago
FPGA power reduction using configurable dual-Vdd
Power optimization is of growing importance for FPGAs in nanometer technologies. Considering dual-Vdd technique, we show that configurable power supply is required to obtain a sat...
Fei Li, Yan Lin, Lei He
ACSC
2004
IEEE
14 years 2 months ago
Tuning the Collision Test for Power
The collision test is an important statistical test for rejecting poor random number generators. The test simulates the throwing of balls randomly into urns. A problem in applying...
Wai Wan Tsang, Lucas Chi Kwong Hui, K. P. Chow, C....
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
14 years 3 months ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
CLUSTER
2005
IEEE
14 years 4 months ago
VioCluster: Virtualization for Dynamic Computational Domains
A large organization, such as a university, commonly supplies computational power through multiple independently administered computational domains (e.g. clusters). Each computati...
Paul Ruth, P. McGachey, Dongyan Xu