1806 search results - page 252 / 362 » Randomness and halting probabilities |
179
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Logit Dynamics [Blume, Games and Economic Behavior, 1993] is a randomized best response dynamics for strategic games: at every time step a player is selected uniformly at random a...
136
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
152
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
125
click to vote
MOBIHOC
2009
ACM
16 years 4 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
173
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...