1422 search results - page 26 / 285 » Test Generation Algorithms Based on Preorder Relations |
SYRCODIS
2007
14 years 11 months ago
2007
As XML has become a standard for data representation, it is inevitable to propose and implement techniques for efficient managing of XML data. A natural alternative is to exploit...
AISC
2006
Springer
15 years 1 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
90
Voted
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
CAEPIA
2011
Springer
13 years 9 months ago
2011
Springer
In this paper we apply the recent notion of anytime universal intelligence tests to the evaluation of a popular reinforcement learning algorithm, Q-learning. We show that a general...
ISCI
2008
14 years 9 months ago
2008
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...