4302 search results - page 554 / 861 » Index Pairs Algorithms |
231
click to vote
POPL
1991
ACM
15 years 11 months ago
1991
ACM
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
249
Voted
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
192
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...
181
Voted
CPM
2008
Springer
15 years 9 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
196
Voted
DAGSTUHL
2007
15 years 9 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...