12183 search results - page 423 / 2437 » Computers under Attacks! |
144
click to vote
IJCAI
2003
15 years 8 months ago
2003
We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regressio...
141
click to vote
IJBC
2007
15 years 6 months ago
2007
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
188
click to vote
INFORMATICALT
2000
15 years 6 months ago
2000
It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. How...
224
click to vote
APAL
2011
15 years 1 months ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
175
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...