Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
We propose to search for common abstractions for different concurrency models to enable high-level language virtual machines to support a wide range of different concurrency model...
This work concentrates on the design of a system intended for study of advanced scheduling techniques for planning various types of jobs in a Grid environment. The solution is able...
Methods for Web link analysis and authority ranking such as PageRank are based on the assumption that a user endorses a Web page when creating a hyperlink to this page. There is a...
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...