653 search results - page 71 / 131 » The size of minimum 3-trees |
162
click to vote
STOC
1992
ACM
15 years 10 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
192
click to vote
DAC
2004
ACM
15 years 10 months ago
2004
ACM
This paper presents a method of generating tests for transition faults using tests for stuck-at faults such that the peak power is the minimum possible using a given set of tests ...
179
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a gregarious particle swarm optimization algorithm (G-PSO) in which the particles explore the search space by aggressively scouting the local minima with the h...
166
click to vote
STOC
2000
ACM
15 years 10 months ago
2000
ACM
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
154
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
As the minimum feature sizes of VLSI circuits get smaller while the clock frequency increases, the effects of process variations become significant. We propose a UST/DME based ap...