Sciweavers

2355 search results - page 217 / 471
» Anonymizing Temporal Data
Sort
View
IMC
2007
ACM
15 years 5 months ago
Using uncleanliness to predict future botnet addresses
The increased use of botnets as an attack tool and the awareness attackers have of blocking lists leads to the question of whether we can effectively predict future bot locations...
M. Patrick Collins, Timothy J. Shimeall, Sidney Fa...
NIPS
2001
15 years 5 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr
ENTCS
2002
143views more  ENTCS 2002»
15 years 4 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...
RTS
2008
131views more  RTS 2008»
15 years 3 months ago
A constant-time dynamic storage allocator for real-time systems
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation ...
Miguel Masmano, Ismael Ripoll, Patricia Balbastre,...
FSTTCS
2010
Springer
15 years 1 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To