706 search results - page 37 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
TCS
2008
13 years 7 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
PDCN
2004
13 years 9 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. This paper presents two different efficiency-enhancement techniques for probabilistic model building genetic algorithms. The first technique proposes the use of a mutatio...
MST
2010
13 years 6 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
CGO
2003
IEEE
13 years 11 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...