Sciweavers

38 search results - page 4 / 8
» Engineering a Lightweight Suffix Array Construction Algorith...
Sort
View
KBSE
2005
IEEE
14 years 29 days ago
Constructing interaction test suites with greedy algorithms
Combinatorial approaches to testing are used in several fields, and have recently gained momentum in the field of software testing through software interaction testing. One-test...
Renée C. Bryce, Charles J. Colbourn
IIS
2004
13 years 8 months ago
Lingo: Search Results Clustering Algorithm Based on Singular Value Decomposition
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search results list returned from a search engine. In this paper we present...
Stanislaw Osinski, Jerzy Stefanowski, Dawid Weiss
SIGSOFT
2007
ACM
14 years 8 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
IWPC
2002
IEEE
14 years 9 days ago
Dependence-Cache Slicing: A Program Slicing Method Using Lightweight Dynamic Information
When we try to debug or to comprehend a large program, it is important to separate suspicious program portions from the overall source program. Program slicing is a promising tech...
Tomonori Takada, Fumiaki Ohata, Katsuro Inoue
COMPSAC
2006
IEEE
14 years 1 months ago
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
Jun Yan, Jian Zhang