The most common problem of an overloaded electronic-commerce server is an increase in the response time perceived by customers, who may restart their requests hoping to get a fast...
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...