Sciweavers

66 search results - page 10 / 14
» Computing All Integer Solutions of a General Elliptic Equati...
Sort
View
RECOMB
1997
Springer
15 years 1 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
IPPS
1998
IEEE
15 years 1 months ago
High Performance Linear Algebra Package LAPACK90
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
Jack Dongarra, Jerzy Wasniewski
MP
1998
109views more  MP 1998»
14 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
JCC
2007
110views more  JCC 2007»
14 years 9 months ago
Electron correlation: The many-body problem at the heart of chemistry
Abstract: The physical interactions among electrons and nuclei, responsible for the chemistry of atoms and molecules, is well described by quantum mechanics and chemistry is theref...
David P. Tew, Wim Klopper, Trygve Helgaker
CPAIOR
2008
Springer
14 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann