3318 search results - page 29 / 664 » The Weak Instance Model |
APWEB
2011
Springer
13 years 2 months ago
2011
Springer
This paper proposes a paraconsistent and nonmonotonic extension of description logic by planting a nonmonotonic mechanism called minimal inconsistency in paradoxical description lo...
ISCA
1998
IEEE
14 years 2 days ago
1998
IEEE
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Various results show that oblivious transfer can be implemented using the assumption of noisy channels. Unfortunately, this assumption is not as weak as one might think, because i...
ACISP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a ...
EVOW
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents an attempt to find a statistical model that predicts the hardness of the University Course Timetabling Problem by analyzing instance properties. The model may l...