2069 search results - page 251 / 414 » Linear time algorithms for Clobber |
169
click to vote
ISMVL
2000
IEEE
15 years 11 months ago
2000
IEEE
Multiple-valued decision diagrams (MDDs) give a way of approaching problems by using symbolic variables which are often more naturally associated with the problem statement than t...
171
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
133
click to vote
DAM
2006
15 years 6 months ago
2006
: In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for m...
186
click to vote
DGCI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
202
click to vote
AMDO
2010
Springer
15 years 3 months ago
2010
Springer
This paper proposes a method of rate-distortion optimisation of an algorithm for compressing dynamic 3D triangle meshes. Although many articles regarding compression methods for th...