16843 search results - page 298 / 3369 » On Generalized Authorization Problems |
148
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
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...
200
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
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...
153
Voted
CSSC
2008
15 years 6 months ago
2008
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...
151
Voted
EOR
2006
15 years 6 months ago
2006
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...
157
click to vote
MP
2006
15 years 6 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...