503 search results - page 3 / 101 » Verifying Quantitative Properties Using Bound Functions |
NA
2010
13 years 5 months ago
2010
It is well known that it is an ill-posed problem to decide whether a function has a multiple root. Even for a univariate polynomial an arbitrary small perturbation of a polynomial ...
ECAL
2005
Springer
14 years 19 days ago
2005
Springer
An evolutionary reinforcement-learning algorithm, the operation of which was not associated with an optimality condition, was instantiated in an artificial organism. The algorithm ...
COCO
1993
Springer
13 years 11 months ago
1993
Springer
Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quan...
KBSE
2005
IEEE
14 years 21 days ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
17
Voted
CORR
2011
Springer
13 years 2 months ago
2011
Springer
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...