Sciweavers

8232 search results - page 1601 / 1647
» Dynamic Logic Programming
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
14 years 2 months ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...
CDC
2008
IEEE
132views Control Systems» more  CDC 2008»
14 years 2 months ago
A distributed auction algorithm for the assignment problem
— 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...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...
CGO
2008
IEEE
14 years 2 months ago
Latency-tolerant software pipelining in a production compiler
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...
Sebastian Winkel, Rakesh Krishnaiyer, Robyn Sampso...
INFOCOM
2008
IEEE
14 years 2 months ago
Firewall Compressor: An Algorithm for Minimizing Firewall Policies
—A firewall is a security guard placed between a private network and the outside Internet that monitors all incoming and outgoing packets. The function of a firewall is to exam...
Alex X. Liu, Eric Torng, Chad R. Meiners
« Prev « First page 1601 / 1647 Last » Next »