14386 search results - page 208 / 2878 » The Chinese Generals Problem |
148
click to vote
CSFW
2011
IEEE
14 years 3 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
154
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
123
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
121
click to vote
BCSHCI
2007
15 years 5 months ago
2007
Eye-tracking research is increasingly used to supplement usability tests in both commercial and academic practice. However, while there has been research into links between eyetra...
128
click to vote
DAM
2008
15 years 4 months ago
2008
We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the...