Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
Abstract— The Deformatron robot is a homogeneous, modular robot. The Deformatron modules can play one of three roles in the physical structure of the robot: bone, tendon, and mus...
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
Abstract. In this paper, the mobility of software processes, a novel concept, is proposed. It is defined as the structural change in a software process resulting from interactions...