Sciweavers

2626 search results - page 139 / 526
» The complexity of stochastic sequences
Sort
View
FASE
2005
Springer
15 years 12 months ago
Coverage Criteria for Testing of Object Interactions in Sequence Diagrams
This work defines several control-flow coverage criteria for testing the interactions among a set of collaborating objects. The criteria are based on UML sequence diagrams that a...
Atanas Rountev, Scott Kagan, Jason Sawin
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
15 years 11 months ago
Evolving Better Multiple Sequence Alignments
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
Luke Sheneman, James A. Foster
COCOON
2005
Springer
15 years 12 months ago
Opportunistic Data Structures for Range Queries
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
Chung Keung Poon, Wai Keung Yiu
AMDO
2008
Springer
15 years 8 months ago
Autonomous Virtual Agents for Performance Evaluation of Tracking Algorithms
This paper describes a framework which exploits the use of computer animation to evaluate the performance of tracking algorithms. This can be achieved in two different, complementa...
Pau Baiget, F. Xavier Roca, Jordi Gonzàlez
BMCBI
2008
83views more  BMCBI 2008»
15 years 6 months ago
An efficient genetic algorithm for structural RNA pairwise alignment and its application to non-coding RNA discovery in yeast
Background: Aligning RNA sequences with low sequence identity has been a challenging problem since such a computation essentially needs an algorithm with high complexities for tak...
Akito Taneda