1289 search results - page 80 / 258 » Complexity of Counting the Optimal Solutions |
105
click to vote
BIBE
2008
IEEE
15 years 4 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...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, ...
48
Voted
ISCA
2003
IEEE
15 years 3 months ago
2003
IEEE
Clustered microarchitectures are an attractive alternative to large monolithic superscalar designs due to their potential for higher clock rates in the face of increasingly wire-d...
EUROPAR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Current trends in CMPs indicate that the core count will increase in the near future. One of the main performance limiters of these forthcoming microarchitectures is the ...