10 search results - page 2 / 2 » Decompositions of graphs of functions and fast iterations of... |
ICCAD
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
ICML
1995
IEEE
14 years 6 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 ...
ICML
2006
IEEE
14 years 6 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
ICML
1996
IEEE
14 years 6 months ago
1996
IEEE
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
GLOBECOM
2008
IEEE
13 years 6 months ago
2008
IEEE
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...