205 search results - page 29 / 41 » Incomparability of Results Between Phylogenetic Search Progr... |
SC
2009
ACM
15 years 4 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 ...
100
click to vote
CGO
2011
IEEE
14 years 1 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
In an environment of distributed text collections, the first step in the information retrieval process is to identify which of all available collections are more relevant to a giv...
ICDM
2008
IEEE
15 years 3 months ago
2008
IEEE
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
There has been a considerable body of work on search–based test data generation for branch coverage. However, hitherto, there has been no work on multi–objective branch covera...