136 search results - page 7 / 28 » Using Rewarding Mechanisms for Improving Branching Heuristic... |
CP
2004
Springer
14 years 26 days ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
IJCAI
2001
13 years 8 months ago
2001
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
ENTCS
2007
13 years 7 months ago
2007
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
VTC
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper, we evaluate the performance of adaptive algorithms for selecting the number of redundant packets by jointly considering the forward error correction (FEC) and au...
RTCSA
2006
IEEE
14 years 1 months ago
2006
IEEE
(m,k)-firm constraints have been used to schedule tasks in soft/firm real-time systems under overloaded conditions. In general, they are provided by application designers to guara...