13987 search results - page 311 / 2798 » The Two Guards Problem |
190
click to vote
IPL
2010
15 years 4 months ago
2010
Polynomial algorithms are given for the following two problems:
177
click to vote
BICOB
2009
Springer
16 years 1 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
184
click to vote
IPL
2008
15 years 6 months ago
2008
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
172
click to vote
COCOON
2005
Springer
16 years 8 days ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
185
click to vote
ICCSA
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...