13987 search results - page 314 / 2798 » The Two Guards Problem |
179
Voted
IPL
2008
15 years 6 months ago
2008
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
158
click to vote
GECCO
2004
Springer
16 years 3 days ago
2004
Springer
An optimization problem is often represented with a set of variables, and the interaction between the variables is referred to as epistasis. In this paper, we propose two new measu...
195
click to vote
DIS
2000
Springer
15 years 11 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
182
click to vote
VLDB
2005
ACM
16 years 6 days ago
2005
ACM
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
172
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...