Sciweavers

741 search results - page 26 / 149
» Memory Dependence Prediction Using Store Sets
Sort
View
AAAI
1998
15 years 3 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
ANOR
2008
66views more  ANOR 2008»
15 years 2 months ago
Optimization problems involving collections of dependent objects
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
David L. Roberts, Charles L. Isbell, Michael L. Li...
135
Voted
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
14 years 1 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
15 years 1 months ago
Predicting the resource consumption of network intrusion detection systems
Abstract. When installing network intrusion detection systems (NIDSs), operators are faced with a large number of parameters and analysis options for tuning trade-offs between dete...
Holger Dreger, Anja Feldmann, Vern Paxson, Robin S...
107
Voted
CHES
2010
Springer
210views Cryptology» more  CHES 2010»
15 years 3 months ago
Flash Memory 'Bumping' Attacks
This paper introduces a new class of optical fault injection attacks called bumping attacks. These attacks are aimed at data extraction from secure embedded memory, which usually s...
Sergei Skorobogatov