3172 search results - page 75 / 635 » On the Random-Self-Reducibility of Complete Sets |
171
click to vote
ITCC
2003
IEEE
15 years 11 months ago
2003
IEEE
Real-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data dep...
159
click to vote
ICANN
2009
Springer
16 years 23 days ago
2009
Springer
We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued Lukasiewicz semantics. Given an appropriate immediate consequence operat...
128
click to vote
VTS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper improves upon the state of the art in testing word oriented memories. It first presents a complete set of fault models for intra-word coupling faults. Then, it establi...
159
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
137
click to vote
PR
2000
15 years 6 months ago
2000
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...