3134 search results - page 116 / 627 » Computing full disjunctions |
108
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We recently introduced an extensional model of the pure λcalculus living in a cartesian closed category of sets and relations. In this paper, we provide sufficient condi...
116
Voted
RTA
2009
Springer
15 years 9 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
108
Voted
DSN
2008
IEEE
15 years 9 months ago
2008
IEEE
A method for Statistical Fault Injection (SFI) into arbitrary latches within a full system hardware-emulated model is validated against particle-beam-accelerated SER testing for a...
107
Voted
GI
2007
Springer
15 years 8 months ago
2007
Springer
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...
130
Voted
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
The autonomic workflow engine enables workflow to be dynamically specified and adapted using Event-Condition-Action rules. A new approach to autonomic execution of workflow process...