2492 search results - page 383 / 499 » False-Name-Proofness in Social Networks |
170
click to vote
CPAIOR
2007
Springer
16 years 19 days ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
158
click to vote
DIS
2007
Springer
16 years 19 days ago
2007
Springer
As mentioned in French secondary school official texts, teaching science implies teaching scientific process. This poses the problem of how to teach epistemology, as traditional sc...
157
click to vote
SIGECOM
2004
ACM
15 years 12 months ago
2004
ACM
Lack of cooperation (free riding) is one of the key problems that confronts today’s P2P systems. What makes this problem particularly difficult is the unique set of challenges ...
263
click to vote
TMC
2008
15 years 6 months ago
2008
Integrating mobile computing and localized user interaction into the Internet requires more than simply overcoming pure routing challenges. Apart from issues such as intermittent c...
164
click to vote
KDD
2010
ACM
15 years 4 months ago
2010
ACM
In an online rating system, raters assign ratings to objects contributed by other users. In addition, raters can develop trust and distrust on object contributors depending on a f...