Sciweavers

66 search results - page 6 / 14
» The Conservation Theorem revisited
Sort
View
BMCBI
2005
137views more  BMCBI 2005»
13 years 7 months ago
A configuration space of homologous proteins conserving mutual information and allowing a phylogeny inference based on pair-wise
Background: Popular methods to reconstruct molecular phylogenies are based on multiple sequence alignments, in which addition or removal of data may change the resulting tree topo...
Olivier Bastien, Philippe Ortet, Sylvaine Roy, Eri...
CGO
2007
IEEE
14 years 1 months ago
On the Complexity of Register Coalescing
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
Florent Bouchez, Alain Darte, Fabrice Rastello
JSYML
2007
100views more  JSYML 2007»
13 years 7 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
FAC
2008
127views more  FAC 2008»
13 years 7 months ago
Mechanising Mondex with Z/Eves
We describe our experiences in mechanising the specification, refinement, and proof of the Mondex Electronic Purse using the Z/Eves theorem prover. We took a conservative approach ...
Leo Freitas, Jim Woodcock
NETWORKS
2006
13 years 7 months ago
The multiroute maximum flow problem revisited
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
Donglei Du, R. Chandrasekaran