900 search results - page 40 / 180 » On Polynomial Time Computation over Unordered Structures |
CP
2007
Springer
14 years 26 days ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
SPIRE
2005
Springer
14 years 2 months ago
2005
Springer
We introduce the notion of conservative edit distance and mapping between two RNA stem-loops. We show that unlike the general edit distance between RNA secondary structures, the co...
ATVA
2007
Springer
14 years 3 months ago
2007
Springer
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
AGP
1999
IEEE
14 years 1 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...