Sciweavers

3628 search results - page 26 / 726
» The Decision Diffie-Hellman Problem
Sort
View
ATAL
2011
Springer
12 years 7 months ago
Information elicitation for decision making
Proper scoring rules, particularly when used as the basis for a prediction market, are powerful tools for eliciting and aggregating beliefs about events such as the likely outcome...
Yiling Chen, Ian A. Kash
POPL
2011
ACM
12 years 10 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
ICDT
2011
ACM
242views Database» more  ICDT 2011»
12 years 11 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
DLT
2010
13 years 9 months ago
Computing Blocker Sets for the Regular Post Embedding Problem
Abstract. Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these lan...
Pierre Chambart, Philippe Schnoebelen
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
11 years 10 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish