7988 search results - page 1045 / 1598 » A Useful Undecidable Theory |
166
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
We examine the problem of evaluating a policy in the contextual bandit setting using only observations collected during the execution of another policy. We show that policy evalua...
170
Voted
ICML
2004
IEEE
16 years 8 months ago
2004
IEEE
Hill-climbing search is the most commonly used search algorithm in ILP systems because it permits the generation of theories in short running times. However, a well known drawback...
179
Voted
SIGSOFT
2005
ACM
16 years 8 months ago
2005
ACM
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
202
Voted
SIGSOFT
2005
ACM
16 years 8 months ago
2005
ACM
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
190
click to vote
WWW
2008
ACM
16 years 8 months ago
2008
ACM
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...