Sciweavers

699 search results - page 113 / 140
» The method of combinatorial telescoping
Sort
View
AAAI
2010
13 years 10 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...
DAGSTUHL
2007
13 years 10 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
LREC
2008
111views Education» more  LREC 2008»
13 years 10 months ago
Low-Density Language Bootstrapping: the Case of Tajiki Persian
Low-density languages raise difficulties for standard approaches to natural language processing that depend on large online corpora. Using Persian as a case study, we propose a no...
Karine Megerdoomian, Dan Parvaz
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 9 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
AAAI
2000
13 years 9 months ago
A Game-Theoretic Approach to Constraint Satisfaction
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
Phokion G. Kolaitis, Moshe Y. Vardi