1941 search results - page 81 / 389 » On the Hardness of Approximate Reasoning |
108
click to vote
ESA
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
IDA
2003
Springer
15 years 5 months ago
2003
Springer
Because uncertain reasoning is often intractable, it is hard to reason with a large amount of knowledge. One solution to this problem is to specify a set of possible models, some s...
LPAR
2005
Springer
15 years 5 months ago
2005
Springer
We propose to build an automated reasoning system for first-order logic (FOL) by translating reasoning problems to a fragment of FOL called coherent logic (CL) and then solving t...
119
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...