Sciweavers

8154 search results - page 1527 / 1631
» Understanding changes in use cases: A case study
Sort
View
FASE
2006
Springer
15 years 2 months ago
Trace-Based Memory Aliasing Across Program Versions
One of the major costs of software development is associated with testing and validation of successive versions of software systems. An important problem encountered in testing and...
Murali Krishna Ramanathan, Suresh Jagannathan, Ana...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 2 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
USS
2008
15 years 1 months ago
CloudAV: N-Version Antivirus in the Network Cloud
Antivirus software is one of the most widely used tools for detecting and stopping malicious and unwanted files. However, the long term effectiveness of traditional hostbased anti...
Jon Oberheide, Evan Cooke, Farnam Jahanian
ECAI
2008
Springer
15 years 29 days ago
Heuristics for Dynamically Adapting Propagation
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
Kostas Stergiou
ITSL
2008
15 years 19 days ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
« Prev « First page 1527 / 1631 Last » Next »