相关论文: Bounded ACh Unification
The field of computational complexity is concerned both with the intrinsic hardness of computational problems and with the efficiency of algorithms to solve them. Given such a problem, normally one designs an algorithm to solve it and sets…
We construct a sequence that converges to a solution of the Cauchy problem for a singularly perturbed linear inhomogeneous differential equation of an arbitrary order. This sequence is also an asymptotic sequence in the following sense: the…
This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is…
In many applications one wants to identify identical subtrees of a program syntax tree. This identification should ideally be robust to alpha-renaming of the program, but no existing technique has been shown to achieve this with good…
In this paper, we study the multiplication operators on the Bloch space of a bounded homogeneous domain in $\mathbb{C}^n$. Specifically, we characterize the bounded and the compact multiplication operators, establish estimates on the…
We consider the boundary value problem \begin{equation} - \Delta u = \lambda c(x)u+ \mu(x) |\nabla u|^2 + h(x), \qquad u \in H^1_0(\Omega) \cap L^{\infty}(\Omega), \leqno{(P_{\lambda})} \end{equation} where $\Omega \subset \R^N, N \geq 3$…
Verification of temporal logic properties plays a crucial role in proving the desired behaviors of hybrid systems. In this paper, we propose an interval method for verifying the properties described by a bounded linear temporal logic. We…
Due to the superiority in similarity computation and database storage for large-scale multiple modalities data, cross-modal hashing methods have attracted extensive attention in similarity retrieval across the heterogeneous modalities.…
Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper, using tools from graph theory and additive number theory,…
Universal quantifiers occur frequently in proof obligations produced by program verifiers, for instance, to axiomatize uninterpreted functions and to express properties of arrays. SMT-based verifiers typically reason about them via…
Several aspects of pluripotential theory are generalized to octonionic plurisubharmonic (OPSH) functions of two variables. We prove the comparison principle for continuous OPSH functions and the quasicontinuity of locally bounded ones. An…
We study regularity of bound states pertaining to embedded eigenvalues of a self-adjoint operator $H$, with respect to an auxiliary operator $A$ that is conjugate to $H$ in the sense of Mourre. We work within the framework of singular…
This paper presents the constrained Hybrid Metaheuristic (cHM) algorithm as a general framework for continuous optimisation. Unlike many existing metaheuristics that are tailored to specific function classes or problem domains, cHM is…
In this paper we deal with a doubly nonlinear Cahn-Hilliard system, where both an internal constraint on the time derivative of the concentration and a potential for the concentration are introduced. The definition of the chemical potential…
The problem of checking whether a recursive query can be rewritten as query without recursion is a fundamental reasoning task, known as the boundedness problem. Here we study the boundedness problem for Unions of Conjunctive Regular Path…
In this work we study approximation algorithms for the \textit{Bounded Color Matching} problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge $e$ has a color $c_e$ and a profit $p_e \in…
In this paper, we investigate bounded action theories in the situation calculus. A bounded action theory is one which entails that, in every situation, the number of object tuples in the extension of fluents is bounded by a given constant,…
Symbolic automata are finite state automata that support potentially infinite alphabets, such as the set of rational numbers, generally applied to regular expressions/languages over finite words. In symbolic automata (or automata modulo…
We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been…
The multiplicative update (MU) algorithm has been extensively used to estimate the basis and coefficient matrices in nonnegative matrix factorization (NMF) problems under a wide range of divergences and regularizers. However, theoretical…