2214 search results - page 375 / 443 » Complexity of Reasoning |
247
click to vote
POPL
2003
ACM
16 years 3 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
122
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
127
click to vote
PERCOM
2006
ACM
16 years 2 months ago
2006
ACM
Many information services in pervasive computing offer rich information, which is information that includes other types of information. For example, the information listed in a pe...
117
click to vote
CSE
2009
IEEE
15 years 9 months ago
2009
IEEE
—Multi-agent systems are difficult to develop. One reason for this is that agents are embedded in a society where all agents must agree to obey certain social norms in order for...
113
click to vote
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...