2905 search results - page 146 / 581 » Formal Memetic Algorithms |
SAS
2007
Springer
14 years 4 months ago
2007
Springer
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
SAS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
IFL
1997
Springer
14 years 2 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
FORMATS
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
DAGSTUHL
2004
13 years 11 months ago
2004
Next to prediction accuracy, the interpretability of models is one of the fundamental criteria for machine learning algorithms. While high accuracy learners have intensively been e...