Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
This paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keepi...
Although many spatio-temporal conceptual models has been proposed in the last years, users must express their queries on the underlying physical data structures. In the context of ...
In this paper we propose a computational grid platform called JaWS++ that seeks to harvest the power of idle pools of workstations connected through the Internet and integrate them...