Sciweavers

358 search results - page 53 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
INFOCOM
2011
IEEE
14 years 5 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...
SIGMOD
2009
ACM
219views Database» more  SIGMOD 2009»
16 years 2 months ago
Hermes: a travel through semantics on the data web
The Web as a global information space is developing from a Web of documents to a Web of data. This development opens new ways for addressing complex information needs. Search is n...
Haofen Wang, Thomas Penin, Kaifeng Xu, Junquan Che...
GRID
2003
Springer
15 years 7 months ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
IEEEPACT
2009
IEEE
14 years 11 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...
CLOUD
2010
ACM
15 years 7 months ago
A self-organized, fault-tolerant and scalable replication scheme for cloud storage
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...