3228 search results - page 445 / 646 » Computationally Sound Proofs |
164
Voted
FOSSACS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
138
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
114
click to vote
PKC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...
135
Voted
PKC
2004
Springer
15 years 9 months ago
2004
Springer
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
87
Voted
DATE
2003
IEEE
15 years 8 months ago
2003
IEEE
Given a plant Å and a specification Å , the largest solution of the FSM equation Å ¯ Å Å contains all possible discrete controllers Å . Often we are interested in computin...