136 search results - page 1 / 28 » Using Rewarding Mechanisms for Improving Branching Heuristic... |
SAT
2004
Springer
13 years 10 months ago
2004
Springer
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
How should a reinforcement learning agent act if its sole purpose is to efficiently learn an optimal policy for later use? In other words, how should it explore, to be able to exp...
ACMMSP
2004
ACM
13 years 10 months ago
2004
ACM
As superscalar processors become increasingly wide, it is inevitable that the large set of instructions to be fetched every cycle will span multiple noncontiguous basic blocks. Th...
HPCA
2007
IEEE
14 years 5 months ago
2007
IEEE
If-conversion is a compiler technique that reduces the misprediction penalties caused by hard-to-predict branches, transforming control dependencies into data dependencies. Althou...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...