Sciweavers

38 search results - page 5 / 8
» Engineering a Lightweight Suffix Array Construction Algorith...
Sort
View
KBSE
2000
IEEE
13 years 11 months ago
Exploring the Design of an Intentional Naming Scheme with an Automatic Constraint Analyzer
Lightweight formal modeling and automatic analysis were used to explore the design of the Intentional Naming System (INS), a new scheme for resource discovery in a dynamic network...
Sarfraz Khurshid, Daniel Jackson
ICSE
2005
IEEE-ACM
14 years 7 months ago
A framework of greedy methods for constructing interaction test suites
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...
Charles J. Colbourn, Myra B. Cohen, Renée C...
APWEB
2004
Springer
14 years 24 days ago
Semantic, Hierarchical, Online Clustering of Web Search Results
Today, search engine is the most commonly used tool for Web information retrieval, however, its current status is still far from satisfaction. This paper focuses on clustering Web...
Dell Zhang, Yisheng Dong
BMCBI
2008
128views more  BMCBI 2008»
13 years 7 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
ISSRE
2003
IEEE
14 years 20 days ago
Augmenting Simulated Annealing to Build Interaction Test Suites
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...