30 search results - page 5 / 6 » State Space Compression with Predictive Representations |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
ANCS
2006
ACM
14 years 1 months ago
2006
ACM
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
This paper extends the framework of dynamic influence diagrams (DIDs) to the multi-agent setting. DIDs are computational representations of the Partially Observable Markov Decisio...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Takens' Embedding Theorem remarkably established that concatenating M previous outputs of a dynamical system into a vector (called a delay coordinate map) can be a one-to-one...
PVLDB
2008
13 years 7 months ago
2008
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...