18306 search results - page 337 / 3662 » Algorithmics in Exponential Time |
154
click to vote
SPIRE
2001
Springer
15 years 11 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
151
click to vote
BIRTHDAY
1999
Springer
15 years 11 months ago
1999
Springer
We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute si...
152
click to vote
TABLEAUX
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. linTAP is a tableau prover for the multiplicative and exponential fragment M?LL of Girards linear logic. It proves the validity of a given formula by constructing an anal...
172
click to vote
AAAI
2007
15 years 9 months ago
2007
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
164
click to vote
WSC
2007
15 years 9 months ago
2007
We discuss efficient Monte Carlo (MC) methods for the estimation of convex risk measures within the portfolio credit risk model CreditMetrics. Our focus lies on the Utilitybased ...