2137 search results - page 365 / 428 » Proving Abstract Non-interference |
JSYML
2008
13 years 10 months ago
2008
Abstract. We prove new upper bound theorems on the consistency strengths of SPFA(), SPFA(-linked) and SPFA(+ -cc). Our results are in terms of (, )-subcompactness, which is a new l...
ECCC
2007
13 years 10 months ago
2007
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
ENTCS
2007
13 years 10 months ago
2007
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
JSAC
2006
13 years 10 months ago
2006
Abstract--Although the capacity of multiple-input/multipleoutput (MIMO) broadcast channels (BCs) can be achieved by dirty paper coding (DPC), it is difficult to implement in practi...
MSS
2008
IEEE
13 years 10 months ago
2008
IEEE
Abstract. We study farsighted coalitional stability in the context of TUgames. Chwe (1994, p.318) notes that, in this context, it is difficult to prove nonemptiness of the largest ...