5757 search results - page 1107 / 1152 » Dynamic Policy Programming |
125
Voted
ISMM
2009
Springer
15 years 8 months ago
2009
Springer
Applying computer technology, such as computer vision in driver assistance, implies that processes and data are modeled as being discretized rather than being continuous. The area ...
147
Voted
BIBE
2008
IEEE
15 years 8 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...
118
Voted
BIBM
2008
IEEE
15 years 8 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...
143
Voted
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
82
Voted
CGO
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...