63 search results - page 12 / 13 » Algorithmic Algebraic Model Checking III: Approximate Method... |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
CONCUR
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
167
click to vote
POPL
2005
ACM
15 years 10 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
101
click to vote
JFP
2008
14 years 9 months ago
2008
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...