16091 search results - page 2843 / 3219 » Solving |
222
click to vote
BIBE
2008
IEEE
16 years 1 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
190
click to vote
BIBM
2008
IEEE
16 years 1 months ago
2008
IEEE
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
195
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
154
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper deals with the tracking problem for constrained linear systems using a model predictive control (MPC) law. As it is well known, MPC provides a control law suitable f...
186
click to vote
CGO
2008
IEEE
16 years 1 months ago
2008
IEEE
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...