1945 search results - page 139 / 389 » Speeding up Serpent |
146
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
170
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
180
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
A typical goal for transfer learning algorithms is to utilize knowledge gained in a source task to learn a target task faster. Recently introduced transfer methods in reinforcemen...
131
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
192
click to vote
ICML
1998
IEEE
16 years 7 months ago
1998
IEEE
This paper introduces the RL-TOPs architecture for robot learning, a hybrid system combining teleo-reactive planning and reinforcement learning techniques. The aim of this system ...