438 search results - page 55 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
MM
2004
ACM
14 years 1 months ago
2004
ACM
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...
JMLR
2012
11 years 11 months ago
2012
We study the prevalent problem when a test distribution differs from the training distribution. We consider a setting where our training set consists of a small number of sample d...