2173 search results - page 250 / 435 » On the Values of Reducibility Candidates |
135
click to vote
IJCAI
2001
15 years 8 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
169
click to vote
IJCAI
2001
15 years 8 months ago
2001
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
166
click to vote
IJCAI
2001
15 years 8 months ago
2001
The task of causal structure discovery from empirical data is a fundamental problem in many areas. Experimental data is crucial for accomplishing this task. However, experiments a...
181
click to vote
NIPS
2004
15 years 8 months ago
2004
Successful application of reinforcement learning algorithms often involves considerable hand-crafting of the necessary non-linear features to reduce the complexity of the value fu...
142
click to vote
UAI
2004
15 years 8 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...