136 search results - page 2 / 28 » Using Rewarding Mechanisms for Improving Branching Heuristic... |
103
click to vote
ICML
2003
IEEE
15 years 6 months ago
2003
IEEE
Shaping can be an effective method for improving the learning rate in reinforcement systems. Previously, shaping has been heuristically motivated and implemented. We provide a for...
116
click to vote
AIPS
2006
15 years 2 months ago
2006
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
115
click to vote
PLDI
1995
ACM
15 years 4 months ago
1995
ACM
Correctly predicting the direction that branches will take is increasingly important in today’s wide-issue computer architectures. The name program-based branch prediction is gi...
125
click to vote
SAT
2005
Springer
15 years 6 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
116
click to vote
ICML
1999
IEEE
16 years 1 months ago
1999
IEEE
Consider the task of exploring the Web in order to find pages of a particular kind or on a particular topic. This task arises in the construction of search engines and Web knowled...