4171 search results - page 262 / 835 » Choice numbers of graphs |
179
click to vote
CIA
2007
Springer
15 years 10 months ago
2007
Springer
: Coalition formation in social networks consisting of a graph of interdependent agents allows many choices of which task to select and with whom to partner in the social network. ...
190
click to vote
FUN
2007
Springer
15 years 10 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
184
click to vote
ACSAC
2003
IEEE
15 years 10 months ago
2003
IEEE
When a receiver of a ciphertext message can not decrypt the message due to the fact that he has lost his private-key, the private-key of the receiver and session-key of the messag...
181
click to vote
POS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper presents the performance evaluation of five memory allocation strategies for the PerDiS Persistent Distributed Object store in the context of allocating two di...
172
click to vote
CEAS
2008
Springer
15 years 8 months ago
2008
Springer
We consider activity-centered tasks in email, including the novel task of predicting future involvement of persons from an enterprise in an ongoing activity represented by a folde...