70 search results - page 7 / 14 » Binary (generalized) Post Correspondence Problem |
88
Voted
SDM
2011
SIAM
14 years 8 days ago
2011
SIAM
Popular data mining methods support knowledge discovery from patterns that hold in binary relations. We study the generalization of association rule mining within arbitrary n-ary ...
ECP
1997
Springer
15 years 1 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
120
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
MCU
2004
14 years 10 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...