2095 search results - page 195 / 419 » Improved pebbling bounds |
184
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
160
click to vote
ITC
2000
IEEE
15 years 11 months ago
2000
IEEE
A deterministic partitioning technique for fault diagnosis in Scan-Based BIST is proposed. Properties of high quality partitions for improved fault diagnosis times are identified...
146
click to vote
ITC
1996
IEEE
15 years 10 months ago
1996
IEEE
While technology is changing the face of the world, it itself is changing by leaps and bounds; there is a continuing trend to put more functionality on the same piece of silicon. ...
165
click to vote
HICSS
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper proposes the use of process models for DSS design. The kind of process models suggested are task structures and decision structures with simple graphical syntax and sem...
173
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...