3172 search results - page 190 / 635 » On the Random-Self-Reducibility of Complete Sets |
154
click to vote
DBISP2P
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The vast majority of the interactions in typical online communities nowadays is between complete strangers. In such settings reputation reporting and trust management mod...
161
click to vote
ECAL
2003
Springer
15 years 11 months ago
2003
Springer
I investigate the competition dynamics between two identical clones of digital organisms, for three sets of clones taken from different locations in the fitness landscape. When t...
191
click to vote
ICDT
2003
ACM
15 years 11 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
166
click to vote
ICDT
2003
ACM
15 years 11 months ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
151
click to vote
ECBS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper identifies the essential components of a Requirements Engineering (RE) process and provides alternatives to the Requirements Analyst (RA) when deciding on a particular ...