1941 search results - page 121 / 389 » On the Hardness of Approximate Reasoning |
226
click to vote
ECCC
2007
15 years 6 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
178
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
This paper introduces a neural network architecture based on rough sets and rough membership functions. The neurons of such networks instantiate approximate reasoning in assessing ...
160
click to vote
WSC
2001
15 years 7 months ago
2001
Various stochastic programmingproblemscan be formulated as problems of optimization of an expected value function. Quite often the corresponding expectation function cannot be com...
189
click to vote
IMR
2003
Springer
15 years 11 months ago
2003
Springer
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
185
click to vote
ICLP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...