4930 search results - page 405 / 986 » Learning minimal abstractions |
163
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
155
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
Abstract — This paper describes a practical technique for the optimal scheduling of control dominated systems minimizing the weighted average latency over all control branches. S...
285
click to vote
ERSHOV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
158
click to vote
PSIVT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likeli...
192
click to vote
SAMOS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Memory access latency can limit microcontroller system performance. SDRAM access control policies impact latency through SDRAM device state. It is shown that execution ti...