2064 search results - page 360 / 413 » A Comparative Study of Fuzzy Sets and Rough Sets |
JCDL
2010
ACM
15 years 5 months ago
2010
ACM
The“wisdom of crowds”is accomplishing tasks that are cumbersome for individuals yet cannot be fully automated by means of specialized computer algorithms. One such task is the...
PPOPP
1997
ACM
15 years 4 months ago
1997
ACM
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
139
click to vote
HPCA
1996
IEEE
15 years 4 months ago
1996
IEEE
This paper compares several implementations of entry consistency (EC) and lazy release consistency (LRC), two relaxed memory models in use with software distributed shared memory ...
104
click to vote
EUROCAST
2007
Springer
15 years 3 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
ITSL
2008
15 years 1 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...