Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

103

Voted

JCSC
2002

72views more JCSC 2002»

Greedy Algorithms for the Test Selection Problem in Protocol Conformance Testing

15 years 2 months ago

Greedy Algorithms for the Test Selection Problem in Protocol Conformance Testing

Download www.freeweb.hu

Tibor Csöndes, Balázs Kotnyek

Real-time Traffic

JCSC 2002 |

claim paper

Related Content

» Specification Coverage Aided Test Selection

» Test Suite Reduction in Conformance Testing

» Greedy genetic and greedy genetic algorithms for the quadratic knapsack problem

» Symbolic Test Selection Based on Approximate Analysis

» Selecting Genomes for Reconstruction of Ancestral Genomes

» Correct Passive Testing Algorithms and Complete Fault Coverage

» Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Di...

» SelectionInsertion Schemes in Genetic Algorithms for the Flexible Ligand Docking Problem

» Using Static Analysis to Improve Automatic Test Generation

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JCSC
Authors	Tibor Csöndes, Balázs Kotnyek

Comments (0)