In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
This paper presents an architecture for solving generically the problem of extracting the constraints of a given task in a programming by demonstration framework and the problem...
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
In this paper, we describe ChucK – a programming language and programming model for writing precisely timed, concurrent audio synthesis and multimedia programs. Precise concurre...