2925 search results - page 339 / 585 » Information Complexity of Online Problems |
202
click to vote
IAT
2009
IEEE
15 years 10 months ago
2009
IEEE
When intelligent systems reason about complex problems with a large hierarchical classification space it is hard to evaluate system performance. For classification problems, differ...
183
click to vote
FLAIRS
2007
15 years 9 months ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
172
click to vote
AMW
2010
15 years 8 months ago
2010
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
186
click to vote
ICMLA
2008
15 years 8 months ago
2008
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
140
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...