4066 search results - page 511 / 814 » Almost Complete Sets |
192
click to vote
GROUP
2010
ACM
15 years 5 months ago
2010
ACM
This paper focuses on online gift exchange in a setting where online and offline interactions are tightly intertwined and most of the exchanges require face-to-face interaction to...
196
click to vote
SUM
2010
Springer
15 years 5 months ago
2010
Springer
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined ...
187
click to vote
EUSFLAT
2009
15 years 5 months ago
2009
Fuzzy C-Means (FCM) and hard clustering are the most common tools for data partitioning. However, the presence of noisy observations in the data may cause generation of completely ...
225
click to vote
CPC
2010
15 years 4 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
192
click to vote
IJAMCIGI
2010
15 years 4 months ago
2010
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...