2503 search results - page 345 / 501 » A study of 3-arc graphs |
112
click to vote
CACM
2008
15 years 5 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
146
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
163
click to vote
ECCC
2010
15 years 5 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
167
click to vote
IEE
2008
15 years 5 months ago
2008
Aspect mining tries to identify crosscutting concerns in the code of existing systems and thus supports their adaption to an aspect-oriented design. A semi-automatic static aspect...
173
click to vote
CSJM
2006
15 years 5 months ago
2006
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...