In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
As colleges and universities are moving into the realm of providing Internet connections to the residence dormitories (ResNet), the local help desk is becoming the focal point for...
Abstract. Despite its technological success story, the Internet is facing a rampant growth of isolated ontologies and a massive dump of unstructured legacy data. Therefore, archite...
Auctions are a widely used approach for determining the current market price for congested resources. However, using them for real systems, such as the Internet, the auction algor...