1941 search results - page 67 / 389 » On the Hardness of Approximate Reasoning |
NIPS
2008
15 years 1 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
104
click to vote
CP
2009
Springer
15 years 6 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
101
click to vote
ER
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work o...
103
click to vote
FOIS
2006
15 years 1 months ago
2006
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
WSDM
2010
ACM
15 years 9 months ago
2010
ACM
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...