Sciweavers

4438 search results - page 311 / 888
» The Case for Collaborative Programming
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
MICRO
1996
IEEE
97views Hardware» more  MICRO 1996»
15 years 11 months ago
Modulo Scheduling of Loops in Control-intensive Non-numeric Programs
Much of the previous work on modulo scheduling has targeted numeric programs, in which, often, the majority of the loops are well-behaved loop-counter-based loops without early ex...
Daniel M. Lavery, Wen-mei W. Hwu
FASE
2006
Springer
15 years 10 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...
BMCBI
2006
115views more  BMCBI 2006»
15 years 6 months ago
The accuracy of several multiple sequence alignment programs for proteins
Background: There have been many algorithms and software programs implemented for the inference of multiple sequence alignments of protein and DNA sequences. The "true" ...
Paulo A. S. Nuin, Zhouzhi Wang, Elisabeth R. M. Ti...
ICCS
2004
Springer
16 years 4 days ago
Computational Engineering and Science Program at the University of Utah
We summarize the Computational Engineering and Science program at the University of Utah. Program requirements as well as related research areas are outlined. To obtain the MS degr...
Carleton DeTar, Aaron L. Fogelson, Christopher R. ...