Sciweavers

14165 search results - page 188 / 2833
» The generalized two-server problem
Sort
View
CP
2005
Springer
15 years 9 months ago
Uncertainty in Soft Constraint Problems
Preferences and uncertainty occur in many real-life problems. The theory of possibility is one way of dealing with uncertainty, which allows for easy integration with fuzzy prefer...
Maria Silvia Pini, Francesca Rossi
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
15 years 9 months ago
The Bottleneck Problem with Minimum Quantity Commitments
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
Andrew Lim, Zhou Xu
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
15 years 8 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim
CSSC
2008
62views more  CSSC 2008»
15 years 4 months ago
An Adaptive Test for the Two-Sample Location Problem Based on U-Statistics
For the two-sample location problem we consider a general class of tests, all members of it are based on U-statistics. The asymptotic efficicacies are investigated in detail. We c...
Wolfgang Kössler, N. Kumar
EOR
2006
81views more  EOR 2006»
15 years 4 months ago
A note on duality gap in the simple plant location problem
This paper studies the duality gap in the simple plant location problem, and presents general formulas for the gap when certain complementary slackness conditions are satisfied. W...
Nenad Mladenovic, Jack Brimberg, Pierre Hansen