2905 search results - page 69 / 581 » Formal Memetic Algorithms |
FORTE
1994
13 years 10 months ago
1994
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
ICPP
2006
IEEE
14 years 2 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
KI
2002
Springer
13 years 8 months ago
2002
Springer
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an imple...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...