3663 search results - page 392 / 733 » Problems in the ontology of computer programs |
174
click to vote
BIBE
2005
IEEE
16 years 13 days ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
180
click to vote
FOCS
1992
IEEE
15 years 11 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
226
click to vote
IEEESCC
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
170
click to vote
TALG
2010
15 years 5 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
181
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...