Sciweavers

127 search results - page 25 / 26
» Counter-Based Cache Replacement Algorithms
Sort
View
CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
13 years 6 months ago
Oblivious RAM Revisited
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
Benny Pinkas, Tzachy Reinman
MSWIM
2005
ACM
13 years 11 months ago
Content and service replication strategies in multi-hop wireless mesh networks
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...
Shudong Jin, Limin Wang
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
13 years 12 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt
AAAI
2008
13 years 7 months ago
Another Look at Search-Based Drama Management
A drama manager (DM) monitors an interactive experience, such as a computer game, and intervenes to shape the global experience so it satisfies the author's expressive goals ...
Mark J. Nelson, Michael Mateas
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
13 years 10 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...