8903 search results - page 1720 / 1781 » Alternative |
NDJFL
1998
14 years 9 months ago
1998
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
NN
1998
Springer
14 years 9 months ago
1998
Springer
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
112
click to vote
SCP
1998
14 years 9 months ago
1998
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
SIAMCOMP
1998
14 years 9 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
SIAMCO
2002
14 years 9 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...