249 search results - page 19 / 50 » Optimal Testing of Reed-Muller Codes |
PR
1998
13 years 9 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
LCPC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We have designed and implemented an interprocedural algorithm to analyze symbolic value ranges that can be assumed by variables at any given point in a program. Our algor...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
Software developers use testing to gain and maintain confidence in the correctness of a software system. Automated reduction and prioritization techniques attempt to decrease the...
KBSE
1998
IEEE
14 years 2 months ago
1998
IEEE
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
ACCV
2009
Springer
14 years 4 months ago
2009
Springer
We present a novel algorithm for unsupervised segmentation of natural images that harnesses the principle of minimum description length (MDL). Our method is based on observations ...