4469 search results - page 91 / 894 » Dynamic Program Slicing |
AAAI
2010
13 years 9 months ago
2010
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...
LCPC
2007
Springer
14 years 1 months ago
2007
Springer
Program dynamic optimization, adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations o...
ATVA
2009
Springer
14 years 2 months ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
We present a novel technique that speeds up state-space exploration (SSE) for evolving programs with dynamically allocated data. SSE is the essence of explicit-state model checkin...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...