1941 search results - page 82 / 389 » On the Hardness of Approximate Reasoning |
142
click to vote
SODA
2007
ACM
15 years 1 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
100
click to vote
FLAIRS
2007
15 years 2 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...
ICML
1995
IEEE
16 years 21 days ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
CAD
2008
Springer
15 years 4 hour ago
2008
Springer
Curves on surfaces play an important role in computer-aided geometric design. Because of the considerably high degree of exact curves on surfaces, approximation algorithms are pre...
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...