Sciweavers

4670 search results - page 596 / 934
» Testing that distributions are close
Sort
View
INFOCOM
2005
IEEE
16 years 1 months ago
Dynamic node activation in networks of rechargeable sensors
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...
Koushik Kar, Ananth Krishnamurthy, Neeraj Jaggi
IPPS
2005
IEEE
16 years 1 months ago
Reducing Power with Performance Constraints for Parallel Sparse Applications
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
Guangyu Chen, Konrad Malkowski, Mahmut T. Kandemir...
171
Voted
VLDB
2005
ACM
116views Database» more  VLDB 2005»
16 years 1 months ago
Client Assignment in Content Dissemination Networks for Dynamic Data
Consider a content distribution network consisting of a set of sources, repositories and clients where the sources and the repositories cooperate with each other for efficient di...
Shetal Shah, Krithi Ramamritham, Chinya V. Ravisha...
HPDC
2003
IEEE
16 years 26 days ago
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is...
Francisco Matias Cuenca-Acuna, Christopher Peery, ...
IAT
2003
IEEE
16 years 26 days ago
Problem-solving in open environments
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
Santiago Macho-Gonzalez, Boi Faltings