Sciweavers

33 search results - page 2 / 7
» Greedy Algorithms for the Test Selection Problem in Protocol...
Sort
View
RECOMB
2007
Springer
14 years 6 months ago
Selecting Genomes for Reconstruction of Ancestral Genomes
It is often impossible to sequence all descendent genomes to reconstruct an ancestral genome. In addition, more genomes do not necessarily give a higher accuracy for the reconstruc...
Guoliang Li, Jian Ma, Louxin Zhang
FORTE
2003
13 years 7 months ago
Correct Passive Testing Algorithms and Complete Fault Coverage
The aim of passive testing is to detect faults in a system while observing the system during normal operation, that is, without forcing the system to specialized inputs explicitly ...
Arun N. Netravali, Krishan K. Sabnani, Ramesh Visw...
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
13 years 11 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
GECCO
2004
Springer
13 years 11 months ago
Selection-Insertion Schemes in Genetic Algorithms for the Flexible Ligand Docking Problem
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....
Camila S. de Magalhães, Helio J. C. Barbosa...
TACAS
2000
Springer
121views Algorithms» more  TACAS 2000»
13 years 9 months ago
Using Static Analysis to Improve Automatic Test Generation
Conformance testing is still the main industrial validation technique for telecommunication protocols. The automatic construction of test cases based on the model approach is hinde...
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu