Sciweavers

8540 search results - page 161 / 1708
» The Dynamic Servers Problem
Sort
View
83
Voted
SIGMETRICS
2000
ACM
14 years 10 months ago
Minimizing the impact of orphan requests in e-commerce services
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...
E. Kraemer, Goedson T. Paixão, Dorgival Ola...
96
Voted
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 20 days ago
Optimizing index for taxonomy keyword search
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 ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
IJCAI
1989
14 years 11 months ago
A Planning/Scheduling Methodology for the Constrained Resource Problem
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...
Naiping Keng, David Y. Y. Yun
98
Voted
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 4 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
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....
Giuseppe Di Fatta, Michael R. Berthold
CPAIOR
2006
Springer
15 years 1 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
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...
Radu Marinescu 0002, Rina Dechter