5275 search results - page 492 / 1055 » Computing by observing |
208
click to vote
PPOPP
2010
ACM
16 years 4 months ago
2010
ACM
We present a static analysis for the automatic generation of symbolic prefetches in a transactional distributed shared memory. A symbolic prefetch specifies the first object to be...
277
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— A decentralized sensor positioning algorithm is proposed using an adaptive weighted-interpolation method. The proposed method utilizes in-network processing among sensors to co...
204
click to vote
CIKM
2006
Springer
15 years 11 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
202
click to vote
AAAI
2006
15 years 8 months ago
2006
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
204
click to vote
CORR
2004
Springer
15 years 7 months ago
2004
Springer
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...