2944 search results - page 102 / 589 » Improving Bound Propagation |
114
click to vote
COLT
2000
Springer
15 years 8 months ago
2000
Springer
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process ( ¢¡¤£¦¥§ ), and focus on gradient ascent approache...
151
click to vote
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-r...
146
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
144
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
150
click to vote
VMCAI
2005
Springer
15 years 9 months ago
2005
Springer
Bounded model checking (BMC) is an automatic verification method that is based on a finite unfolding of the system’s transition relation. BMC has been successfully applied, in ...