Sciweavers

1165 search results - page 189 / 233
» Effective linear programming based placement methods
Sort
View
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 8 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
IEEECIT
2010
IEEE
13 years 7 months ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...
BMCBI
2007
160views more  BMCBI 2007»
13 years 8 months ago
Convergent algorithms for protein structural alignment
Background: Many algorithms exist for protein structural alignment, based on internal protein coordinates or on explicit superposition of the structures. These methods are usually...
Leandro Martínez, Roberto Andreani, Jos&eac...
BMCBI
2006
134views more  BMCBI 2006»
13 years 8 months ago
A statistical score for assessing the quality of multiple sequence alignments
Background: Multiple sequence alignment is the foundation of many important applications in bioinformatics that aim at detecting functionally important regions, predicting protein...
Virpi Ahola, Tero Aittokallio, Mauno Vihinen, Esa ...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 9 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya