11740 search results - page 257 / 2348 » More Problems in Rewriting |
173
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
240
click to vote
IJCAI
2003
15 years 8 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
173
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
147
click to vote
PVLDB
2010
15 years 5 months ago
2010
Virtual views are a mechanism that facilitates re-use and makes queries easier to express. However the use of iterative view definitions makes very simple query evaluation and an...
161
click to vote
CPM
2007
Springer
16 years 23 days ago
2007
Springer
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...