3820 search results - page 79 / 764 » Bounded Model Debugging |
104
Voted
SODA
1997
ACM
15 years 3 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
115
click to vote
OOPSLA
2005
Springer
15 years 7 months ago
2005
Springer
There is a critical need for approaches to support software testing. Our research exploits the information described at Architectural Patterns to drive the definition of tests. As...
114
click to vote
DATE
2004
IEEE
15 years 6 months ago
2004
IEEE
This paper presents a versatile hardware/software cosimulation and co-design environment for embedded 3D graphics accelerators. The GRAphics AcceLerator design exploration framewo...
114
Voted
IJCNN
2007
IEEE
15 years 8 months ago
2007
IEEE
—Starting from the strict interpolation equations for multivariate polynomials, an upper bound is developed for the number of patterns that can be memorized by a nonlinear feedfo...
93
Voted
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...