157 search results - page 23 / 32 » Tackling Post's Correspondence Problem |
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
TASE
2011
IEEE
13 years 2 months ago
2011
IEEE
: This paper addresses the dynamic pricing problem of a single-item, make-to-stock production system. Demand arrives according to Poisson processes with changeable arrival rate dep...
MCU
2004
13 years 8 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
13 years 11 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 ...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Ontology matching, aiming to obtain semantic correspondences between two ontologies, has played a key role in data exchange, data integration and metadata management. Among numero...