361 search results - page 14 / 73 » Approximate counting by dynamic programming |
NIPS
2007
14 years 11 months ago
2007
Recently, we have introduced a novel approach to dynamic programming and reinforcement learning that is based on maintaining explicit representations of stationary distributions i...
67
Voted
CGO
2004
IEEE
15 years 1 months ago
2004
IEEE
Dynamic binary translators use a two-phase approach to identify and optimize frequently executed code dynamically. In the first step (profiling phase), blocks of code are interpre...
124
click to vote
PLDI
2005
ACM
15 years 3 months ago
2005
ACM
Robust and powerful software instrumentation tools are essential for program analysis tasks such as profiling, performance evaluation, and bug detection. To meet this need, we ha...
CPM
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
ARC
2008
Springer
14 years 9 months ago
2008
Springer
: This paper describes the theory of feedback control in the class inputs which allow delta-functions and their derivatives. It indicates a modification of dynamic programming tech...