2905 search results - page 436 / 581 » Formal Memetic Algorithms |
134
Voted
CAV
2009
Springer
16 years 4 months ago
2009
Springer
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifier-free finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, enc...
113
click to vote
CAV
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another....
114
Voted
KDD
2004
ACM
16 years 4 months ago
2004
ACM
In the domain of gene expression data analysis, various researchers have recently emphasized the promising application of pattern discovery techniques like association rule mining...
215
Voted
POPL
2006
ACM
16 years 3 months ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
224
Voted
POPL
2005
ACM
16 years 3 months ago
2005
ACM
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...