1236 search results - page 142 / 248 » Programming by Demonstration for Information Agents |
102
click to vote
ESOP
2011
Springer
14 years 2 months ago
2011
Springer
Programs written in scripting languages employ idioms that confound conventional type systems. In this paper, we highlight one important set of related idioms: the use of local con...
102
click to vote
AAAI
2004
15 years 19 days ago
2004
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...
CC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
ASPLOS
2008
ACM
15 years 1 months ago
2008
ACM
Many hardware optimizations rely on collecting information about program behavior at runtime. This information is stored in lookup tables. To be accurate and effective, these opti...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...