Sciweavers

1515 search results - page 291 / 303
» Parallel computing on any desktop
Sort
View
SPAA
2009
ACM
14 years 3 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
COLCOM
2008
IEEE
14 years 1 months ago
Data Quality and Failures Characterization of Sensing Data in Environmental Applications
Environmental monitoring is one of the most important sensor network application domains. The success of those applications is determined by the quality of the collected data. Thu...
Kewei Sha, Guoxing Zhan, Safwan Al-Omari, Tim Cala...
CCGRID
2007
IEEE
14 years 1 months ago
Integrated Data Reorganization and Disk Mapping for Reducing Disk Energy Consumption
Increasing power consumption of high-performance systems leads to reliability, survivability, and cooling related problems. Motivated by this observation, several recent efforts f...
Seung Woo Son, Mahmut T. Kandemir
CLUSTER
2005
IEEE
14 years 10 days ago
Supporting iWARP Compatibility and Features for Regular Network Adapters
With several recent initiatives in the protocol offloading technology present on network adapters, the user market is now distributed amongst various technology levels including r...
Pavan Balaji, Hyun-Wook Jin, Karthikeyan Vaidyanat...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 8 days ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma