Sciweavers

1254 search results - page 40 / 251
» Making Hard Problems Harder
Sort
View
BCB
2010
156views Bioinformatics» more  BCB 2010»
13 years 2 months ago
RepFrag: a graph based method for finding repeats and transposons from fragmented genomes
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...
ECOOPW
1998
Springer
13 years 12 months ago
Replication as an Aspect
We have performed an experiment in writing an aspect language for replication. This experiment has shown that although at rst sight replication could easily be described as an asp...
Johan Fabry
ICFP
2007
ACM
14 years 7 months ago
Ott: effective tool support for the working semanticist
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...
Peter Sewell, Francesco Zappa Nardelli, Scott Owen...
VEE
2012
ACM
222views Virtualization» more  VEE 2012»
12 years 3 months ago
Unpicking the knot: teasing apart VM/application interdependencies
Flexible and efficient runtime design requires an understanding of the dependencies among the components internal to the runtime and those between the application and the runtime...
Yi Lin, Stephen M. Blackburn, Daniel Frampton
CONCUR
2000
Springer
14 years 1 days ago
The Control of Synchronous Systems
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...