205 search results - page 27 / 41 » When Can Limited Randomness Be Used in Repeated Games |
JAL
2006
13 years 8 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
EMSOFT
2003
Springer
14 years 1 months ago
2003
Springer
We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more compon...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the sum of the individual sensor processing result...
SIGECOM
2008
ACM
13 years 8 months ago
2008
ACM
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
ALGORITHMICA
2011
13 years 3 months ago
2011
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...