We describe an exact decoding algorithm for syntax-based statistical translation. The approach uses Lagrangian relaxation to decompose the decoding problem into tractable subprobl...
Abstract. It has been observed that there are interesting relations between planning and agent programming. This is not surprising as agent programming was partially motivated by t...
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 ...
Byeongcheol Lee, Kevin Resnick, Michael D. Bond, K...
Distributed parallel applications often run for hours or even days before arriving to a result. In the case of such long-running programs, the initial requirements could change aft...
Dong Kwan Kim, Myoungkyu Song, Eli Tilevich, Calvi...
Combining static and dynamic information is highly relevant in many reverse engineering, program comprehension and maintenance task. Dynamic analysis is particularly effective whe...