Sciweavers

14386 search results - page 222 / 2878
» The Chinese Generals Problem
Sort
View
ISIPTA
1999
IEEE
15 years 8 months ago
Treatment Choice Under Ambiguity Induced by Inferential Problems
Inferential problems that arise in the empirical analysis oftreatmentresponseinduceambiguityabouttheidentity of optimal treatment rules. This paper describes a research program th...
Charles F. Manski
FOCS
2009
IEEE
15 years 11 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
131
Voted
CP
2005
Springer
15 years 10 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 10 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