159 search results - page 22 / 32 » Computational Complexity of Fundamental Problems in Social C... |
136
click to vote
SIGECOM
2011
ACM
14 years 2 months ago
2011
ACM
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
108
click to vote
PVLDB
2010
14 years 10 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
103
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
161
click to vote
FOCS
1997
IEEE
15 years 4 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
WWW
2008
ACM
16 years 15 days ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...