Sciweavers

3190 search results - page 48 / 638
» cans 2011
Sort
View
INFOCOM
2011
IEEE
14 years 4 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik
97
Voted
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 7 months ago
Aging in language dynamics
Human languages evolve continuously, and a puzzling problem is how to reconcile the apparent robustness of most of the deep linguistic structures we use with the evidence that the...
Animesh Mukherjee, Francesca Tria, Andrea Baronche...
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 4 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
ATAL
2011
Springer
14 years 14 days ago
Incentive design for adaptive agents
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....
90
Voted
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 7 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin