1687 search results - page 273 / 338 » Which pointer analysis should I use |
140
click to vote
ICML
1995
IEEE
16 years 4 months ago
1995
IEEE
A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that ...
127
click to vote
ESORICS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Covert timing channels aim at transmitting hidden messages by controlling the time between transmissions of consecutive payload packets in overt network communication. Pr...
114
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
138
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
173
click to vote
CIVR
2007
Springer
15 years 10 months ago
2007
Springer
This paper deals with a new interest points detector. Unlike most standard detectors which concentrate on the local shape of the signal, the main objective of this new operator is...