1972 search results - page 289 / 395 » Evolutionary algorithms and dynamic programming |
128
click to vote
SC
2009
ACM
15 years 11 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
129
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
162
click to vote
CGO
2008
IEEE
15 years 11 months ago
2008
IEEE
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
154
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Background: Accurate estimation of statistical significance of a pairwise alignment is an important problem in sequence comparison. Recently, a comparative study of pairwise stati...
126
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for inst...