267 search results - page 6 / 54 » Efficient and decentralized computation of approximate globa... |
122
click to vote
CCGRID
2004
IEEE
15 years 3 months ago
2004
IEEE
Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in a P2P resource sharing environment is an efficient searching algorit...
153
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
TCAD
2008
14 years 11 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
DSN
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each storage-node. Such versioning enables the protocol...
105
click to vote
EWSN
2007
Springer
15 years 11 months ago
2007
Springer
Initial deployments of wireless sensor networks (WSNs) were based on a many-to-one communication paradigm, where a single sink collects data from a number of data sources. Recently...