1941 search results - page 25 / 389 » On the Hardness of Approximate Reasoning |
122
click to vote
IJCAI
1989
15 years 3 months ago
1989
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...
94
Voted
SAGT
2009
Springer
15 years 8 months ago
2009
Springer
We study economic means to improve network performance in the well-known game theoretic traffic model due to Wardrop. We introduce two sorts of spam flow - auxiliary and adversari...
109
click to vote
LMCS
2006
15 years 1 months ago
2006
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisi...
234
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
134
Voted
EUSFLAT
2003
15 years 3 months ago
2003
A comparison is made of two approaches to approximate reasoning: Mamdani's interpolation method and the implication method. Both approaches are variants of Zadeh's compo...