1941 search results - page 105 / 389 » On the Hardness of Approximate Reasoning |
162
click to vote
IJCAI
2003
15 years 7 months ago
2003
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...
130
click to vote
IWANN
2001
Springer
15 years 10 months ago
2001
Springer
We propose a novel approach based upon a superposition of ‘colored’ and ‘white’ noise to approximate current inputs in neural models. Numerical results show that the novel ...
189
click to vote
RR
2010
Springer
15 years 4 months ago
2010
Springer
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
175
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
154
click to vote
ICPR
2008
IEEE
16 years 25 days ago
2008
IEEE
We consider a regression problem where target values are given as intervals, and propose a statistical approach to it. Although it is hard to solve the optimization problem direct...