437 search results - page 80 / 88 » Reducing Memory Sharing Overheads in Distributed JVMs |
AAAI
2008
13 years 10 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
PDCN
2004
13 years 9 months ago
2004
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
ICNP
2003
IEEE
14 years 1 months ago
2003
IEEE
The publish/subscribe (pub/sub) paradigm provides content-oriented data dissemination in which communication channels are established between content publishers and content subscr...
SIGMETRICS
2010
ACM
14 years 16 days ago
2010
ACM
We present S, the first system to provide transparent, lowoverhead application record-replay and the ability to go live from replayed execution. S i...
TMC
2008
13 years 7 months ago
2008
Key predistribution has been claimed to be the only viable approach for establishing shared keys between neighboring sensors after deployment for a typical sensor network. However,...