3172 search results - page 69 / 635 » On the Random-Self-Reducibility of Complete Sets |
180
click to vote
RSA
2002
15 years 6 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
202
click to vote
COMPSAC
2006
IEEE
16 years 27 days ago
2006
IEEE
The Sage development method and associated tool set support an incremental, iterative, model-driven process to build and maintain high assurance, reactive multi-agent systems. A s...
179
click to vote
ECML
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
158
click to vote
EUSFLAT
2003
15 years 8 months ago
2003
In this article we propose a new measure of similarity for intuitionistic fuzzy sets. The proposed measure takes into account not only a pure distance between elements but measure...
138
click to vote
BSL
2008
15 years 7 months ago
2008
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...