286 search results - page 5 / 58 » Weak Ordering - A New Definition |
CAISE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Today, companies are immersed in extremely competitive worldwide markets that change continuously. Thus, companies have to evolve introducing strategic and structural cha...
AIL
2000
13 years 7 months ago
2000
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
TPHOL
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
FTCS
1993
13 years 9 months ago
1993
Failure detectors (or, more accurately Failure Suspectors { FS) appear to be a fundamental service upon which to build fault-tolerant, distributed applications. This paper shows t...
SACRYPT
2001
Springer
14 years 8 days ago
2001
Springer
Abstract. Inthis paper we present several weaknesses in the keyscheduling algorithm of RC4, and describe their cryptanalytic signi cance. We identify a large number of weak keys, i...