Sciweavers

16844 search results - page 3227 / 3369
» How to Design Programs
Sort
View
BMCBI
2011
14 years 10 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
CC
2011
Springer
270views System Software» more  CC 2011»
14 years 10 months ago
Subregion Analysis and Bounds Check Elimination for High Level Arrays
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
Mackale Joyner, Zoran Budimlic, Vivek Sarkar
CSMR
2011
IEEE
14 years 10 months ago
Software Maintenance Research in the PROGRESS Project for Predictable Embedded Software Systems
Abstract—PROGRESS is a project and strategic research centre at M¨alardalen University in Sweden that is funded for 2006– 2010 by the Swedish Foundation for Strategic Research...
Johan Kraft, Holger M. Kienle, Thomas Nolte, Ivica...
SIGMETRICS
2011
ACM
245views Hardware» more  SIGMETRICS 2011»
14 years 9 months ago
Record and transplay: partial checkpointing for replay debugging across heterogeneous systems
Software bugs that occur in production are often difficult to reproduce in the lab due to subtle differences in the application environment and nondeterminism. To address this pr...
Dinesh Subhraveti, Jason Nieh
CADE
2011
Springer
14 years 6 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
« Prev « First page 3227 / 3369 Last » Next »