Sciweavers

32 search results - page 2 / 7
» When is social computation better than the sum of its parts
Sort
View
AMEC
2004
Springer
13 years 10 months ago
A Budget-Balanced, Incentive-Compatible Scheme for Social Choice
Abstract. Many practical scenarios involve solving a social choice problem: a group of self-interested agents have to agree on an outcome that best fits their combined preferences...
Boi Faltings
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
13 years 10 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
14 years 5 months ago
Relational learning via latent social dimensions
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...
Lei Tang, Huan Liu
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 5 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
11 years 7 months ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li