5314 search results - page 609 / 1063 » Hybrid Dynamic Programming |
328
click to vote
POPL
2008
ACM
16 years 8 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
190
click to vote
DATE
2009
IEEE
16 years 2 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
224
click to vote
PLDI
2005
ACM
16 years 1 months ago
2005
ACM
We present a new technique, path slicing, that takes as input a possibly infeasible path to a target location, and eliminates all the operations that are irrelevant towards the re...
186
click to vote
ECOOP
2004
Springer
16 years 29 days ago
2004
Springer
After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, th...
216
Voted
SC
2003
ACM
16 years 25 days ago
2003
ACM
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participa...