Sciweavers

570 search results - page 94 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
SAINT
2007
IEEE
14 years 3 months ago
Data Management on Grid Filesystem for Data-Intensive Computing
In parallel computing environments such as HPC clusters and the Grid, data-intensive applications involve large overhead costs due to a concentration of access to the files on co...
Hitoshi Sato, Satoshi Matsuoka
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 9 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
SRDS
2008
IEEE
14 years 3 months ago
Probabilistic Failure Detection for Efficient Distributed Storage Maintenance
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...
Jing Tian, Zhi Yang, Wei Chen, Ben Y. Zhao, Yafei ...
IPPS
2009
IEEE
14 years 3 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
MSN
2005
Springer
14 years 2 months ago
Population Estimation for Resource Inventory Applications over Sensor Networks
Abstract. The growing advance in wireless communications and electronics makes the development of low-cost and low-power sensors possible. These sensors are usually small in size a...
Jiun-Long Huang