Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Abstract. One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and del...
We consider a distributed server system and ask which policy should be used for assigning tasks to hosts. In our server, tasks are not preemptible. Also, the task's service d...
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...