1291 search results - page 150 / 259 » Arithmetic program paths |
ISSTA
1989
ACM
14 years 2 months ago
1989
ACM
The all-du-paths software testing criterion is the most discriminating of the data ow testing criteria of Rapps and Weyuker. Unfortunately, in the worst case, the criterion requir...
GLVLSI
2010
IEEE
14 years 1 days ago
2010
IEEE
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
ASPDAC
2005
ACM
14 years 12 hour ago
2005
ACM
— A method for timing driven placement is presented. The core of the approach is optimal timing-driven relaxed placement based on a linear programming (LP) formulation. The formu...
CVPR
2011
IEEE
13 years 7 months ago
2011
IEEE
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
INFOCOM
2011
IEEE
13 years 1 months ago
2011
IEEE
—This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fract...