159 search results - page 25 / 32 » Computational Complexity of Fundamental Problems in Social C... |
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Software systems are subject to increasing complexity and in need of efficient structuring. Multi-agent system research has come up with approaches for an organization-oriented co...
SIGECOM
2003
ACM
15 years 5 months ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
109
click to vote
ACMSE
2010
ACM
14 years 6 months ago
2010
ACM
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
113
click to vote
BIRTHDAY
2010
Springer
15 years 28 days ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
159
click to vote
WWW
2008
ACM
16 years 15 days ago
2008
ACM
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social network...