Sciweavers

5326 search results - page 955 / 1066
» On what we can ensure
Sort
View
TEC
2010
173views more  TEC 2010»
15 years 1 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
PODC
2011
ACM
14 years 9 months ago
From bounded to unbounded concurrency objects and back
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
Yehuda Afek, Adam Morrison, Guy Wertheim
SIGECOM
2011
ACM
311views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
The role of social networks in online shopping: information passing, price of trust, and consumer choice
While social interactions are critical to understanding consumer behavior, the relationship between social and commerce networks has not been explored on a large scale. We analyze...
Stephen Guo, Mengqiu Wang, Jure Leskovec
WSDM
2012
ACM
283views Data Mining» more  WSDM 2012»
14 years 1 months ago
The life and death of online groups: predicting group growth and longevity
We pose a fundamental question in understanding how to identify and design successful communities: What factors predict whether a community will grow and survive in the long term?...
Sanjay Ram Kairam, Dan J. Wang, Jure Leskovec
SPAA
2009
ACM
16 years 6 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch