1422 search results - page 121 / 285 » Complementation in Abstract Interpretation |
121
click to vote
FPCA
1989
15 years 8 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
149
click to vote
ICANN
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A new classification algorithm based on combination of kernel density estimators is introduced. The method combines the estimators with different bandwidths what can be i...
127
click to vote
ACSD
2006
IEEE
15 years 8 months ago
2006
IEEE
Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing...
109
click to vote
MPC
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
151
click to vote
EUROGP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific ...