136 search results - page 2 / 28 » Using Rewarding Mechanisms for Improving Branching Heuristic... |
ICML
2003
IEEE
13 years 10 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...
AIPS
2006
13 years 6 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...
PLDI
1995
ACM
13 years 8 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...
SAT
2005
Springer
13 years 10 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...
ICML
1999
IEEE
14 years 6 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...