4095 search results - page 43 / 819 » How to test a tree |
DATE
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper proposes an efficient test methodology to test switches in a Network-on-Chip (NoC) architecture. A switch in an NoC consists of a number of ports and a router. Using th...
151
click to vote
APAQS
2001
IEEE
15 years 7 months ago
2001
IEEE
Integration testing has always been a challenge especially if the system under test is large with many subsystems and interfaces. This paper proposes an approach to design End-toE...
137
Voted
SDM
2009
SIAM
16 years 16 days ago
2009
SIAM
Automotive companies are forced to continuously extend and improve their product line-up. However, increasing diversity, higher design complexity, and shorter development cycles c...
170
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
154
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...