Sciweavers

4595 search results - page 899 / 919
» Reasoning about Plans
Sort
View
BMCBI
2008
125views more  BMCBI 2008»
13 years 8 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
CACM
2010
179views more  CACM 2010»
13 years 8 months ago
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...
Peter Sewell, Susmit Sarkar, Scott Owens, Francesc...
BMCBI
2008
86views more  BMCBI 2008»
13 years 8 months ago
Is plant mitochondrial RNA editing a source of phylogenetic incongruence? An answer from in silico and in vivo data sets
Background: In plant mitochondria, the post-transcriptional RNA editing process converts C to U at a number of specific sites of the mRNA sequence and usually restores phylogeneti...
Ernesto Picardi, Carla Quagliariello
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 8 months ago
Bounded Model Checking of Multi-threaded Software using SMT solvers
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
Lucas Cordeiro, Bernd Fischer 0002
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 8 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner