Sciweavers

301 search results - page 60 / 61
» The Optimisation of Unitising Designs
Sort
View
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
15 years 3 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
FP
1989
124views Formal Methods» more  FP 1989»
15 years 3 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
DGCI
2009
Springer
15 years 3 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
BMCBI
2008
78views more  BMCBI 2008»
14 years 11 months ago
A new protein linear motif benchmark for multiple sequence alignment software
Background: Linear motifs (LMs) are abundant short regulatory sites used for modulating the functions of many eukaryotic proteins. They play important roles in post-translational ...
Emmanuel Perrodou, Claudia Chica, Olivier Poch, To...
BMCBI
2007
114views more  BMCBI 2007»
14 years 11 months ago
Combination of scoring schemes for protein docking
Background: Docking algorithms are developed to predict in which orientation two proteins are likely to bind under natural conditions. The currently used methods usually consist o...
Philipp Heuser, Dietmar Schomburg